/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:58:38,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:58:38,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:58:38,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:58:38,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:58:38,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:58:38,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:58:38,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:58:38,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:58:38,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:58:38,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:58:38,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:58:38,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:58:38,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:58:38,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:58:38,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:58:38,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:58:38,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:58:38,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:58:38,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:58:38,324 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:58:38,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:58:38,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:58:38,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:58:38,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:58:38,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:58:38,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:58:38,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:58:38,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:58:38,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:58:38,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:58:38,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:58:38,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:58:38,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:58:38,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:58:38,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:58:38,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:58:38,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:58:38,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:58:38,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:58:38,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:58:38,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:58:38,340 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:58:38,350 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:58:38,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:58:38,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:58:38,351 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:58:38,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:58:38,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:58:38,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:58:38,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:58:38,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:58:38,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:58:38,353 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:58:38,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:58:38,353 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:58:38,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:58:38,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:58:38,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:58:38,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:58:38,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:58:38,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:58:38,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:58:38,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:58:38,354 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:58:38,354 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:58:38,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:58:38,354 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:58:38,354 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 07:58:38,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:58:38,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:58:38,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:58:38,565 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:58:38,565 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:58:38,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound5.c [2022-04-28 07:58:38,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536a89c54/482863e19acc4e31b03e73edefa8dc49/FLAGec3053fad [2022-04-28 07:58:38,960 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:58:38,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound5.c [2022-04-28 07:58:38,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536a89c54/482863e19acc4e31b03e73edefa8dc49/FLAGec3053fad [2022-04-28 07:58:38,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536a89c54/482863e19acc4e31b03e73edefa8dc49 [2022-04-28 07:58:38,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:58:38,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:58:38,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:58:38,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:58:38,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:58:38,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:58:38" (1/1) ... [2022-04-28 07:58:38,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ecff0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:38, skipping insertion in model container [2022-04-28 07:58:38,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:58:38" (1/1) ... [2022-04-28 07:58:38,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:58:39,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:58:39,121 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/ps6-ll_valuebound5.c[458,471] [2022-04-28 07:58:39,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:58:39,144 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:58:39,153 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/ps6-ll_valuebound5.c[458,471] [2022-04-28 07:58:39,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:58:39,173 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:58:39,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:39 WrapperNode [2022-04-28 07:58:39,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:58:39,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:58:39,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:58:39,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:58:39,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:39" (1/1) ... [2022-04-28 07:58:39,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:39" (1/1) ... [2022-04-28 07:58:39,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:39" (1/1) ... [2022-04-28 07:58:39,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:39" (1/1) ... [2022-04-28 07:58:39,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:39" (1/1) ... [2022-04-28 07:58:39,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:39" (1/1) ... [2022-04-28 07:58:39,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:39" (1/1) ... [2022-04-28 07:58:39,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:58:39,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:58:39,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:58:39,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:58:39,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:39" (1/1) ... [2022-04-28 07:58:39,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:58:39,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:39,218 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 07:58:39,223 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 07:58:39,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:58:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:58:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:58:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:58:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:58:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:58:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:58:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:58:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:58:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:58:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:58:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:58:39,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:58:39,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:58:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:58:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:58:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:58:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:58:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:58:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:58:39,301 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:58:39,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:58:39,450 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:58:39,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:58:39,456 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:58:39,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:58:39 BoogieIcfgContainer [2022-04-28 07:58:39,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:58:39,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:58:39,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:58:39,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:58:39,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:58:38" (1/3) ... [2022-04-28 07:58:39,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d81cee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:58:39, skipping insertion in model container [2022-04-28 07:58:39,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:39" (2/3) ... [2022-04-28 07:58:39,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d81cee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:58:39, skipping insertion in model container [2022-04-28 07:58:39,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:58:39" (3/3) ... [2022-04-28 07:58:39,469 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound5.c [2022-04-28 07:58:39,479 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:58:39,480 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:58:39,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:58:39,518 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@24254e22, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@175be01f [2022-04-28 07:58:39,518 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:58:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:58:39,531 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:39,531 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:39,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:39,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-28 07:58:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:39,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [854330059] [2022-04-28 07:58:39,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-28 07:58:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:39,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740788809] [2022-04-28 07:58:39,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:39,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:58:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:39,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 07:58:39,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:58:39,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-28 07:58:39,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:58:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:39,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:39,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:39,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:39,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:58:39,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 07:58:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:39,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:39,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:39,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:39,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 07:58:39,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:58:39,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 07:58:39,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:58:39,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-28 07:58:39,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-28 07:58:39,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-28 07:58:39,762 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {32#true} is VALID [2022-04-28 07:58:39,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:39,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:39,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:39,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:58:39,764 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-28 07:58:39,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:39,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:39,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:39,767 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 07:58:39,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 07:58:39,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-28 07:58:39,767 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-28 07:58:39,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 07:58:39,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 07:58:39,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 07:58:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:58:39,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:39,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740788809] [2022-04-28 07:58:39,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740788809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:39,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:39,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:58:39,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:39,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [854330059] [2022-04-28 07:58:39,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [854330059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:39,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:39,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:58:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483751255] [2022-04-28 07:58:39,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:39,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:58:39,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:39,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:39,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:39,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:58:39,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:39,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:58:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:58:39,841 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:40,262 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-28 07:58:40,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:58:40,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:58:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 07:58:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 07:58:40,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-28 07:58:40,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:40,356 INFO L225 Difference]: With dead ends: 51 [2022-04-28 07:58:40,356 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 07:58:40,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:58:40,361 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:40,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 07:58:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 07:58:40,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:40,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:40,384 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:40,385 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:40,388 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 07:58:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:40,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:40,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:40,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-28 07:58:40,389 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-28 07:58:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:40,391 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 07:58:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:40,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:40,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:40,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:40,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 07:58:40,395 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-28 07:58:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:40,395 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 07:58:40,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:40,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 07:58:40,430 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 07:58:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:58:40,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:40,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:40,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:58:40,432 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-28 07:58:40,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:40,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1607788591] [2022-04-28 07:58:40,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-28 07:58:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:40,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958715157] [2022-04-28 07:58:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:40,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:40,477 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:40,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620640631] [2022-04-28 07:58:40,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:40,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:40,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:40,484 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 07:58:40,486 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 07:58:40,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:58:40,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:40,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:58:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:40,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:40,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-28 07:58:40,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-04-28 07:58:40,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:40,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-28 07:58:40,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-28 07:58:40,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {246#true} is VALID [2022-04-28 07:58:40,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {246#true} is VALID [2022-04-28 07:58:40,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 07:58:40,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 07:58:40,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:40,716 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-28 07:58:40,717 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-28 07:58:40,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 07:58:40,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 07:58:40,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:40,720 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-28 07:58:40,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:40,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:40,723 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:40,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:40,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-28 07:58:40,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-28 07:58:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:58:40,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:58:40,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:40,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958715157] [2022-04-28 07:58:40,726 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:40,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620640631] [2022-04-28 07:58:40,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620640631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:40,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:40,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:58:40,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:40,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1607788591] [2022-04-28 07:58:40,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1607788591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:40,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:40,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:58:40,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363110202] [2022-04-28 07:58:40,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:40,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 07:58:40,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:40,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:40,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:40,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:58:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:40,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:58:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:58:40,748 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:40,931 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-28 07:58:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:58:40,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 07:58:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 07:58:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 07:58:40,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 07:58:40,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:40,973 INFO L225 Difference]: With dead ends: 35 [2022-04-28 07:58:40,974 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 07:58:40,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 07:58:40,976 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:40,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 07:58:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 07:58:40,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:40,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:40,997 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:40,997 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:41,008 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 07:58:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:41,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:41,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:41,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-28 07:58:41,010 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-28 07:58:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:41,017 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 07:58:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:41,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:41,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:41,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:41,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-28 07:58:41,022 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-28 07:58:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:41,022 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-28 07:58:41,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:41,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-28 07:58:41,053 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 07:58:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 07:58:41,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:41,054 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:41,081 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 07:58:41,274 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 07:58:41,274 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:41,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-28 07:58:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:41,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1454165786] [2022-04-28 07:58:41,275 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-28 07:58:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:41,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043558597] [2022-04-28 07:58:41,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:41,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:41,297 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:41,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236668821] [2022-04-28 07:58:41,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:41,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:41,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:41,302 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 07:58:41,304 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 07:58:41,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:41,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:41,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:58:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:41,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:41,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-28 07:58:41,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-28 07:58:41,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:41,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-28 07:58:41,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-28 07:58:41,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-28 07:58:41,536 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:41,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:41,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:41,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:41,536 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-28 07:58:41,536 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:41,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:41,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:41,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:41,537 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-28 07:58:41,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:41,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:41,538 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:41,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:41,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:41,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:41,539 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:41,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 07:58:41,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 07:58:41,541 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:41,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:41,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-28 07:58:41,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-28 07:58:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:58:41,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:41,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-28 07:58:41,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-28 07:58:41,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:41,746 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:41,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:41,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:41,793 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #57#return; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:41,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:41,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:41,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:41,794 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:41,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:41,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:41,795 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-28 07:58:41,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:41,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:41,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:41,796 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:41,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-28 07:58:41,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:41,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:41,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:41,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:41,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-28 07:58:41,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-28 07:58:41,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-28 07:58:41,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:41,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-28 07:58:41,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-28 07:58:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:58:41,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:41,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043558597] [2022-04-28 07:58:41,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:41,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236668821] [2022-04-28 07:58:41,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236668821] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:41,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:41,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:58:41,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:41,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1454165786] [2022-04-28 07:58:41,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1454165786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:41,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:41,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:58:41,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932840614] [2022-04-28 07:58:41,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:41,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-28 07:58:41,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:41,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:41,867 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 07:58:41,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:58:41,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:41,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:58:41,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:58:41,868 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:41,999 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 07:58:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:58:42,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-28 07:58:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:58:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:58:42,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 07:58:42,085 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 07:58:42,086 INFO L225 Difference]: With dead ends: 37 [2022-04-28 07:58:42,086 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 07:58:42,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:58:42,087 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:42,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 07:58:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 07:58:42,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:42,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:42,103 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:42,103 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:42,104 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 07:58:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:58:42,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:42,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:42,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-28 07:58:42,105 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-28 07:58:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:42,107 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 07:58:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:58:42,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:42,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:42,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:42,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 07:58:42,109 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-28 07:58:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:42,109 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 07:58:42,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:42,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 07:58:42,306 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 07:58:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:58:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 07:58:42,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:42,307 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:42,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 07:58:42,507 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 07:58:42,508 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-28 07:58:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1351228698] [2022-04-28 07:58:42,509 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-28 07:58:42,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:42,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094299080] [2022-04-28 07:58:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:42,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:42,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:42,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581989868] [2022-04-28 07:58:42,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:42,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:42,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:42,525 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 07:58:42,526 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 07:58:42,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:42,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:42,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:58:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:42,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:42,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-28 07:58:42,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {900#true} is VALID [2022-04-28 07:58:42,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:42,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-28 07:58:42,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-28 07:58:42,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {900#true} is VALID [2022-04-28 07:58:42,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:42,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:42,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:42,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:42,878 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-28 07:58:42,879 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:42,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:42,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:42,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:42,879 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-28 07:58:42,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:42,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:42,892 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:42,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:42,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:42,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:42,900 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:42,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:42,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:42,908 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:42,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:42,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:42,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:42,909 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:42,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:42,909 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:42,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:42,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:42,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:42,910 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:42,911 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:42,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:42,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-28 07:58:42,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-28 07:58:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 07:58:42,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:43,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:43,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094299080] [2022-04-28 07:58:43,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:43,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581989868] [2022-04-28 07:58:43,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581989868] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:43,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:43,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:58:43,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:43,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1351228698] [2022-04-28 07:58:43,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1351228698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:43,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:43,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:58:43,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640807789] [2022-04-28 07:58:43,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:43,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 07:58:43,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:43,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:43,216 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 07:58:43,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:58:43,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:43,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:58:43,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:58:43,218 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:43,451 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 07:58:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:58:43,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 07:58:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 07:58:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 07:58:43,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-28 07:58:43,490 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 07:58:43,491 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:58:43,491 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 07:58:43,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:58:43,492 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:43,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 07:58:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 07:58:43,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:43,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:43,510 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:43,511 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:43,514 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 07:58:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:58:43,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:43,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:43,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 07:58:43,519 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 07:58:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:43,524 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 07:58:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:58:43,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:43,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:43,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:43,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-28 07:58:43,528 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-28 07:58:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:43,528 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-28 07:58:43,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:43,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-28 07:58:43,612 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 07:58:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:58:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 07:58:43,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:43,613 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:43,647 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 07:58:43,813 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 07:58:43,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-28 07:58:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:43,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [734222656] [2022-04-28 07:58:43,815 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:43,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-28 07:58:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:43,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566935522] [2022-04-28 07:58:43,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:43,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:43,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220845083] [2022-04-28 07:58:43,827 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:43,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:43,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:43,828 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 07:58:43,829 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 07:58:43,859 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:43,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:43,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 07:58:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:43,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:44,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-28 07:58:44,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1315#true} is VALID [2022-04-28 07:58:44,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:44,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-28 07:58:44,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-28 07:58:44,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1315#true} is VALID [2022-04-28 07:58:44,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:44,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:44,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:44,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:44,168 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-28 07:58:44,168 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:44,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:44,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:44,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:44,168 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-28 07:58:44,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:44,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:44,169 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:44,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:44,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:44,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:44,170 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:44,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:44,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:44,171 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:44,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:44,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:44,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:44,175 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:44,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:44,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:44,176 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:44,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:44,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:44,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:44,180 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #57#return; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:44,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:44,180 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:44,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:44,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:44,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:44,181 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #59#return; {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:44,182 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:44,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:44,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-28 07:58:44,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-28 07:58:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 07:58:44,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:44,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:44,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566935522] [2022-04-28 07:58:44,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:44,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220845083] [2022-04-28 07:58:44,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220845083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:44,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:44,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:58:44,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:44,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [734222656] [2022-04-28 07:58:44,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [734222656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:44,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:44,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:58:44,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934424184] [2022-04-28 07:58:44,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:44,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-28 07:58:44,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:44,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:44,559 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 07:58:44,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:58:44,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:44,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:58:44,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:58:44,559 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:44,833 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 07:58:44,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:58:44,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-28 07:58:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 07:58:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 07:58:44,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-28 07:58:44,871 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 07:58:44,872 INFO L225 Difference]: With dead ends: 45 [2022-04-28 07:58:44,872 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 07:58:44,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:58:44,873 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:44,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 07:58:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 07:58:44,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:44,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:44,890 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:44,890 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:44,892 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 07:58:44,892 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:58:44,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:44,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:44,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-28 07:58:44,892 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-28 07:58:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:44,893 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 07:58:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:58:44,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:44,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:44,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:44,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-28 07:58:44,895 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-28 07:58:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:44,895 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-28 07:58:44,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:44,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-28 07:58:45,023 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 07:58:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:58:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 07:58:45,024 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:45,024 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:45,045 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 07:58:45,225 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 07:58:45,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:45,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:45,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-28 07:58:45,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:45,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [411840437] [2022-04-28 07:58:45,226 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:45,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-28 07:58:45,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:45,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44644607] [2022-04-28 07:58:45,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:45,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:45,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:45,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413669833] [2022-04-28 07:58:45,239 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:45,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:45,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:45,241 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 07:58:45,242 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 07:58:45,425 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:58:45,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:45,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 07:58:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:45,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:45,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {1792#true} call ULTIMATE.init(); {1792#true} is VALID [2022-04-28 07:58:45,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1792#true} is VALID [2022-04-28 07:58:45,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 07:58:45,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #63#return; {1792#true} is VALID [2022-04-28 07:58:45,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret5 := main(); {1792#true} is VALID [2022-04-28 07:58:45,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1792#true} is VALID [2022-04-28 07:58:45,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {1792#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1792#true} is VALID [2022-04-28 07:58:45,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 07:58:45,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 07:58:45,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 07:58:45,732 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1792#true} {1792#true} #53#return; {1792#true} is VALID [2022-04-28 07:58:45,732 INFO L272 TraceCheckUtils]: 11: Hoare triple {1792#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1792#true} is VALID [2022-04-28 07:58:45,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 07:58:45,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 07:58:45,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 07:58:45,732 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1792#true} {1792#true} #55#return; {1792#true} is VALID [2022-04-28 07:58:45,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {1792#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:45,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:45,733 INFO L272 TraceCheckUtils]: 18: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1792#true} is VALID [2022-04-28 07:58:45,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 07:58:45,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 07:58:45,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 07:58:45,734 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1792#true} {1845#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:45,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:45,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:45,735 INFO L272 TraceCheckUtils]: 25: Hoare triple {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1792#true} is VALID [2022-04-28 07:58:45,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 07:58:45,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 07:58:45,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 07:58:45,735 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1792#true} {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:45,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1889#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:45,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {1889#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {1889#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:45,736 INFO L272 TraceCheckUtils]: 32: Hoare triple {1889#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1792#true} is VALID [2022-04-28 07:58:45,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 07:58:45,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 07:58:45,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 07:58:45,737 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1792#true} {1889#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {1889#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:45,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {1889#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:45,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:45,738 INFO L272 TraceCheckUtils]: 39: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1792#true} is VALID [2022-04-28 07:58:45,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 07:58:45,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 07:58:45,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 07:58:45,744 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1792#true} {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #57#return; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:45,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:45,746 INFO L272 TraceCheckUtils]: 45: Hoare triple {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1792#true} is VALID [2022-04-28 07:58:45,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 07:58:45,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 07:58:45,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 07:58:45,750 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1792#true} {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} #59#return; {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:45,751 INFO L272 TraceCheckUtils]: 50: Hoare triple {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1952#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:45,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {1952#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1956#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:45,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {1956#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1793#false} is VALID [2022-04-28 07:58:45,753 INFO L290 TraceCheckUtils]: 53: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-04-28 07:58:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 07:58:45,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:46,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:46,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44644607] [2022-04-28 07:58:46,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:46,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413669833] [2022-04-28 07:58:46,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413669833] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:46,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:46,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:58:46,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:46,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [411840437] [2022-04-28 07:58:46,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [411840437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:46,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:46,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:58:46,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587425885] [2022-04-28 07:58:46,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:46,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-28 07:58:46,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:46,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:46,141 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 07:58:46,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:58:46,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:46,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:58:46,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:58:46,142 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:46,562 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-28 07:58:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:58:46,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-28 07:58:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 07:58:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 07:58:46,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-28 07:58:46,610 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 07:58:46,611 INFO L225 Difference]: With dead ends: 48 [2022-04-28 07:58:46,611 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 07:58:46,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:58:46,612 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:46,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 197 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:58:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 07:58:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 07:58:46,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:46,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:46,634 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:46,634 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:46,635 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 07:58:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 07:58:46,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:46,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:46,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-28 07:58:46,636 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-28 07:58:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:46,637 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 07:58:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 07:58:46,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:46,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:46,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:46,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-28 07:58:46,639 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-28 07:58:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:46,639 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-28 07:58:46,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:46,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-28 07:58:46,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 07:58:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 07:58:46,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:46,744 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:46,750 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 07:58:46,949 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 07:58:46,950 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:46,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:46,950 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times [2022-04-28 07:58:46,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:46,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1756784023] [2022-04-28 07:58:46,951 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times [2022-04-28 07:58:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:46,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591366756] [2022-04-28 07:58:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:46,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:46,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:46,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809018342] [2022-04-28 07:58:46,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:46,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:46,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:46,963 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 07:58:46,964 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 07:58:47,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:47,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:47,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 07:58:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:47,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:47,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {2309#true} call ULTIMATE.init(); {2309#true} is VALID [2022-04-28 07:58:47,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {2309#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); {2309#true} is VALID [2022-04-28 07:58:47,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-28 07:58:47,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2309#true} {2309#true} #63#return; {2309#true} is VALID [2022-04-28 07:58:47,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {2309#true} call #t~ret5 := main(); {2309#true} is VALID [2022-04-28 07:58:47,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {2309#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; {2309#true} is VALID [2022-04-28 07:58:47,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {2309#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2309#true} is VALID [2022-04-28 07:58:47,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-28 07:58:47,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-28 07:58:47,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-28 07:58:47,550 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2309#true} {2309#true} #53#return; {2309#true} is VALID [2022-04-28 07:58:47,550 INFO L272 TraceCheckUtils]: 11: Hoare triple {2309#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2309#true} is VALID [2022-04-28 07:58:47,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-28 07:58:47,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-28 07:58:47,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-28 07:58:47,550 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2309#true} {2309#true} #55#return; {2309#true} is VALID [2022-04-28 07:58:47,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {2309#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2362#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:47,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {2362#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2362#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:47,553 INFO L272 TraceCheckUtils]: 18: Hoare triple {2362#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2309#true} is VALID [2022-04-28 07:58:47,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-28 07:58:47,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-28 07:58:47,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-28 07:58:47,553 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2309#true} {2362#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2362#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:47,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {2362#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2384#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:47,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {2384#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {2384#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:47,554 INFO L272 TraceCheckUtils]: 25: Hoare triple {2384#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2309#true} is VALID [2022-04-28 07:58:47,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-28 07:58:47,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-28 07:58:47,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-28 07:58:47,555 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2309#true} {2384#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {2384#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:47,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {2384#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2406#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:58:47,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {2406#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2406#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:58:47,556 INFO L272 TraceCheckUtils]: 32: Hoare triple {2406#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2309#true} is VALID [2022-04-28 07:58:47,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-28 07:58:47,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-28 07:58:47,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-28 07:58:47,556 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2309#true} {2406#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {2406#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:58:47,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {2406#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2428#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:47,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {2428#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {2428#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:47,557 INFO L272 TraceCheckUtils]: 39: Hoare triple {2428#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2309#true} is VALID [2022-04-28 07:58:47,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-28 07:58:47,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-28 07:58:47,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-28 07:58:47,558 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2309#true} {2428#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #57#return; {2428#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:47,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {2428#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2450#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:47,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {2450#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !false; {2450#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:47,559 INFO L272 TraceCheckUtils]: 46: Hoare triple {2450#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2309#true} is VALID [2022-04-28 07:58:47,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-28 07:58:47,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-28 07:58:47,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-28 07:58:47,561 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2309#true} {2450#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #57#return; {2450#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:47,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {2450#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2472#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:58:47,561 INFO L272 TraceCheckUtils]: 52: Hoare triple {2472#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2309#true} is VALID [2022-04-28 07:58:47,561 INFO L290 TraceCheckUtils]: 53: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-28 07:58:47,561 INFO L290 TraceCheckUtils]: 54: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-28 07:58:47,561 INFO L290 TraceCheckUtils]: 55: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-28 07:58:47,562 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2309#true} {2472#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} #59#return; {2472#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:58:47,563 INFO L272 TraceCheckUtils]: 57: Hoare triple {2472#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2491#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:47,563 INFO L290 TraceCheckUtils]: 58: Hoare triple {2491#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2495#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:47,563 INFO L290 TraceCheckUtils]: 59: Hoare triple {2495#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2310#false} is VALID [2022-04-28 07:58:47,563 INFO L290 TraceCheckUtils]: 60: Hoare triple {2310#false} assume !false; {2310#false} is VALID [2022-04-28 07:58:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 07:58:47,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:47,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:47,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591366756] [2022-04-28 07:58:47,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:47,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809018342] [2022-04-28 07:58:47,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809018342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:47,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:47,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 07:58:47,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:47,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1756784023] [2022-04-28 07:58:47,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1756784023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:47,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:47,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:58:47,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840159324] [2022-04-28 07:58:47,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:47,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-28 07:58:47,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:47,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:58:47,889 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 07:58:47,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:58:47,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:58:47,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:58:47,890 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:58:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:48,391 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-28 07:58:48,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:58:48,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-28 07:58:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:58:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-28 07:58:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:58:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-28 07:58:48,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-28 07:58:48,432 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 07:58:48,434 INFO L225 Difference]: With dead ends: 51 [2022-04-28 07:58:48,434 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 07:58:48,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:58:48,435 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:48,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:58:48,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 07:58:48,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 07:58:48,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:48,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:48,463 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:48,463 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:48,465 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 07:58:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 07:58:48,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:48,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:48,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-28 07:58:48,465 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-28 07:58:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:48,466 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 07:58:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 07:58:48,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:48,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:48,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:48,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-28 07:58:48,468 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-28 07:58:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:48,468 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-28 07:58:48,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:58:48,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-28 07:58:48,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 07:58:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 07:58:48,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:48,600 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:48,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 07:58:48,804 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 07:58:48,805 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:48,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times [2022-04-28 07:58:48,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:48,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291112885] [2022-04-28 07:58:48,805 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:48,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times [2022-04-28 07:58:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:48,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024480774] [2022-04-28 07:58:48,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:48,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:48,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [337896122] [2022-04-28 07:58:48,822 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:48,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:48,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:48,823 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 07:58:48,824 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 07:58:48,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:48,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:48,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:58:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:48,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:49,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {2844#true} call ULTIMATE.init(); {2844#true} is VALID [2022-04-28 07:58:49,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {2844#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); {2844#true} is VALID [2022-04-28 07:58:49,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {2844#true} assume true; {2844#true} is VALID [2022-04-28 07:58:49,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2844#true} {2844#true} #63#return; {2844#true} is VALID [2022-04-28 07:58:49,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {2844#true} call #t~ret5 := main(); {2844#true} is VALID [2022-04-28 07:58:49,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {2844#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; {2844#true} is VALID [2022-04-28 07:58:49,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {2844#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2844#true} is VALID [2022-04-28 07:58:49,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {2844#true} ~cond := #in~cond; {2844#true} is VALID [2022-04-28 07:58:49,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {2844#true} assume !(0 == ~cond); {2844#true} is VALID [2022-04-28 07:58:49,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {2844#true} assume true; {2844#true} is VALID [2022-04-28 07:58:49,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2844#true} {2844#true} #53#return; {2844#true} is VALID [2022-04-28 07:58:49,264 INFO L272 TraceCheckUtils]: 11: Hoare triple {2844#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2844#true} is VALID [2022-04-28 07:58:49,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {2844#true} ~cond := #in~cond; {2844#true} is VALID [2022-04-28 07:58:49,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {2844#true} assume !(0 == ~cond); {2844#true} is VALID [2022-04-28 07:58:49,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {2844#true} assume true; {2844#true} is VALID [2022-04-28 07:58:49,264 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2844#true} {2844#true} #55#return; {2844#true} is VALID [2022-04-28 07:58:49,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {2844#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2897#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:49,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {2897#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2897#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:49,265 INFO L272 TraceCheckUtils]: 18: Hoare triple {2897#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2844#true} is VALID [2022-04-28 07:58:49,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {2844#true} ~cond := #in~cond; {2844#true} is VALID [2022-04-28 07:58:49,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {2844#true} assume !(0 == ~cond); {2844#true} is VALID [2022-04-28 07:58:49,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {2844#true} assume true; {2844#true} is VALID [2022-04-28 07:58:49,270 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2844#true} {2897#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2897#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:49,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {2897#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2919#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:49,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {2919#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2919#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:49,271 INFO L272 TraceCheckUtils]: 25: Hoare triple {2919#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2844#true} is VALID [2022-04-28 07:58:49,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {2844#true} ~cond := #in~cond; {2844#true} is VALID [2022-04-28 07:58:49,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {2844#true} assume !(0 == ~cond); {2844#true} is VALID [2022-04-28 07:58:49,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {2844#true} assume true; {2844#true} is VALID [2022-04-28 07:58:49,272 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2844#true} {2919#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {2919#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:49,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {2919#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2941#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:49,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {2941#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2941#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:49,273 INFO L272 TraceCheckUtils]: 32: Hoare triple {2941#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2844#true} is VALID [2022-04-28 07:58:49,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {2844#true} ~cond := #in~cond; {2844#true} is VALID [2022-04-28 07:58:49,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {2844#true} assume !(0 == ~cond); {2844#true} is VALID [2022-04-28 07:58:49,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {2844#true} assume true; {2844#true} is VALID [2022-04-28 07:58:49,273 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2844#true} {2941#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {2941#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:49,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {2941#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2963#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:58:49,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {2963#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {2963#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:58:49,274 INFO L272 TraceCheckUtils]: 39: Hoare triple {2963#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2844#true} is VALID [2022-04-28 07:58:49,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {2844#true} ~cond := #in~cond; {2844#true} is VALID [2022-04-28 07:58:49,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {2844#true} assume !(0 == ~cond); {2844#true} is VALID [2022-04-28 07:58:49,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {2844#true} assume true; {2844#true} is VALID [2022-04-28 07:58:49,275 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2844#true} {2963#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #57#return; {2963#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:58:49,275 INFO L290 TraceCheckUtils]: 44: Hoare triple {2963#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2985#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:58:49,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {2985#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2985#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:58:49,276 INFO L272 TraceCheckUtils]: 46: Hoare triple {2985#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2844#true} is VALID [2022-04-28 07:58:49,276 INFO L290 TraceCheckUtils]: 47: Hoare triple {2844#true} ~cond := #in~cond; {2844#true} is VALID [2022-04-28 07:58:49,276 INFO L290 TraceCheckUtils]: 48: Hoare triple {2844#true} assume !(0 == ~cond); {2844#true} is VALID [2022-04-28 07:58:49,276 INFO L290 TraceCheckUtils]: 49: Hoare triple {2844#true} assume true; {2844#true} is VALID [2022-04-28 07:58:49,277 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2844#true} {2985#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #57#return; {2985#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:58:49,277 INFO L290 TraceCheckUtils]: 51: Hoare triple {2985#(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 * ~y~0 * ~y~0 + ~x~0; {3007#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:49,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {3007#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !false; {3007#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:49,278 INFO L272 TraceCheckUtils]: 53: Hoare triple {3007#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2844#true} is VALID [2022-04-28 07:58:49,278 INFO L290 TraceCheckUtils]: 54: Hoare triple {2844#true} ~cond := #in~cond; {2844#true} is VALID [2022-04-28 07:58:49,278 INFO L290 TraceCheckUtils]: 55: Hoare triple {2844#true} assume !(0 == ~cond); {2844#true} is VALID [2022-04-28 07:58:49,278 INFO L290 TraceCheckUtils]: 56: Hoare triple {2844#true} assume true; {2844#true} is VALID [2022-04-28 07:58:49,280 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2844#true} {3007#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #57#return; {3007#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:49,280 INFO L290 TraceCheckUtils]: 58: Hoare triple {3007#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {3029#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:49,280 INFO L272 TraceCheckUtils]: 59: Hoare triple {3029#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2844#true} is VALID [2022-04-28 07:58:49,280 INFO L290 TraceCheckUtils]: 60: Hoare triple {2844#true} ~cond := #in~cond; {2844#true} is VALID [2022-04-28 07:58:49,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {2844#true} assume !(0 == ~cond); {2844#true} is VALID [2022-04-28 07:58:49,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {2844#true} assume true; {2844#true} is VALID [2022-04-28 07:58:49,284 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2844#true} {3029#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #59#return; {3029#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:49,285 INFO L272 TraceCheckUtils]: 64: Hoare triple {3029#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3048#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:49,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {3048#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3052#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:49,285 INFO L290 TraceCheckUtils]: 66: Hoare triple {3052#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2845#false} is VALID [2022-04-28 07:58:49,285 INFO L290 TraceCheckUtils]: 67: Hoare triple {2845#false} assume !false; {2845#false} is VALID [2022-04-28 07:58:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 07:58:49,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:49,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:49,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024480774] [2022-04-28 07:58:49,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:49,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337896122] [2022-04-28 07:58:49,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337896122] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:49,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:49,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 07:58:49,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:49,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291112885] [2022-04-28 07:58:49,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291112885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:49,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:49,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:58:49,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852921699] [2022-04-28 07:58:49,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:49,561 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-28 07:58:49,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:49,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:58:49,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:49,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:58:49,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:49,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:58:49,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:58:49,598 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:58:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:50,177 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 07:58:50,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:58:50,177 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-28 07:58:50,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:58:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 07:58:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:58:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 07:58:50,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-28 07:58:50,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:50,227 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:58:50,227 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 07:58:50,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:58:50,228 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:50,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:58:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 07:58:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 07:58:50,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:50,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:50,251 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:50,251 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:50,252 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-28 07:58:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 07:58:50,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:50,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:50,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-28 07:58:50,253 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-28 07:58:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:50,254 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-28 07:58:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 07:58:50,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:50,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:50,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:50,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-28 07:58:50,256 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-28 07:58:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:50,256 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-28 07:58:50,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:58:50,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-28 07:58:50,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 07:58:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 07:58:50,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:50,365 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:50,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:50,566 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 07:58:50,566 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:50,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times [2022-04-28 07:58:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:50,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [97384240] [2022-04-28 07:58:50,567 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times [2022-04-28 07:58:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:50,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176005258] [2022-04-28 07:58:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:50,586 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:50,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272304688] [2022-04-28 07:58:50,586 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:50,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:50,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:50,589 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 07:58:50,590 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 07:58:50,912 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:58:50,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:50,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:58:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:50,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:51,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {3419#true} call ULTIMATE.init(); {3419#true} is VALID [2022-04-28 07:58:51,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {3419#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); {3419#true} is VALID [2022-04-28 07:58:51,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3419#true} {3419#true} #63#return; {3419#true} is VALID [2022-04-28 07:58:51,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {3419#true} call #t~ret5 := main(); {3419#true} is VALID [2022-04-28 07:58:51,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {3419#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; {3419#true} is VALID [2022-04-28 07:58:51,403 INFO L272 TraceCheckUtils]: 6: Hoare triple {3419#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {3419#true} ~cond := #in~cond; {3445#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:58:51,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {3445#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3449#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:58:51,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {3449#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3449#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:58:51,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3449#(not (= |assume_abort_if_not_#in~cond| 0))} {3419#true} #53#return; {3456#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-28 07:58:51,406 INFO L272 TraceCheckUtils]: 11: Hoare triple {3456#(and (<= main_~k~0 5) (<= 0 main_~k~0))} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,407 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3419#true} {3456#(and (<= main_~k~0 5) (<= 0 main_~k~0))} #55#return; {3456#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-28 07:58:51,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {3456#(and (<= main_~k~0 5) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3475#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 07:58:51,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {3475#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {3475#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 07:58:51,407 INFO L272 TraceCheckUtils]: 18: Hoare triple {3475#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,408 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3419#true} {3475#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} #57#return; {3475#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 07:58:51,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {3475#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3497#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-28 07:58:51,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {3497#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !false; {3497#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-28 07:58:51,409 INFO L272 TraceCheckUtils]: 25: Hoare triple {3497#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,410 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3419#true} {3497#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} #57#return; {3497#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-28 07:58:51,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {3497#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 07:58:51,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 07:58:51,411 INFO L272 TraceCheckUtils]: 32: Hoare triple {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,411 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3419#true} {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} #57#return; {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 07:58:51,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 07:58:51,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 07:58:51,412 INFO L272 TraceCheckUtils]: 39: Hoare triple {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,413 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3419#true} {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} #57#return; {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 07:58:51,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 07:58:51,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 07:58:51,414 INFO L272 TraceCheckUtils]: 46: Hoare triple {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,414 INFO L290 TraceCheckUtils]: 47: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,418 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3419#true} {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} #57#return; {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 07:58:51,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3585#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 07:58:51,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {3585#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {3585#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 07:58:51,419 INFO L272 TraceCheckUtils]: 53: Hoare triple {3585#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,420 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3419#true} {3585#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} #57#return; {3585#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 07:58:51,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {3585#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L290 TraceCheckUtils]: 59: Hoare triple {3420#false} assume !false; {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L272 TraceCheckUtils]: 60: Hoare triple {3420#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L290 TraceCheckUtils]: 61: Hoare triple {3420#false} ~cond := #in~cond; {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L290 TraceCheckUtils]: 62: Hoare triple {3420#false} assume !(0 == ~cond); {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L290 TraceCheckUtils]: 63: Hoare triple {3420#false} assume true; {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3420#false} {3420#false} #57#return; {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L290 TraceCheckUtils]: 65: Hoare triple {3420#false} assume !(~c~0 < ~k~0); {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L272 TraceCheckUtils]: 66: Hoare triple {3420#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L290 TraceCheckUtils]: 67: Hoare triple {3420#false} ~cond := #in~cond; {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L290 TraceCheckUtils]: 68: Hoare triple {3420#false} assume !(0 == ~cond); {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L290 TraceCheckUtils]: 69: Hoare triple {3420#false} assume true; {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3420#false} {3420#false} #59#return; {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L272 TraceCheckUtils]: 71: Hoare triple {3420#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L290 TraceCheckUtils]: 72: Hoare triple {3420#false} ~cond := #in~cond; {3420#false} is VALID [2022-04-28 07:58:51,421 INFO L290 TraceCheckUtils]: 73: Hoare triple {3420#false} assume 0 == ~cond; {3420#false} is VALID [2022-04-28 07:58:51,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {3420#false} assume !false; {3420#false} is VALID [2022-04-28 07:58:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 123 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 07:58:51,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:51,804 INFO L290 TraceCheckUtils]: 74: Hoare triple {3420#false} assume !false; {3420#false} is VALID [2022-04-28 07:58:51,804 INFO L290 TraceCheckUtils]: 73: Hoare triple {3420#false} assume 0 == ~cond; {3420#false} is VALID [2022-04-28 07:58:51,804 INFO L290 TraceCheckUtils]: 72: Hoare triple {3420#false} ~cond := #in~cond; {3420#false} is VALID [2022-04-28 07:58:51,804 INFO L272 TraceCheckUtils]: 71: Hoare triple {3420#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3420#false} is VALID [2022-04-28 07:58:51,804 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3419#true} {3420#false} #59#return; {3420#false} is VALID [2022-04-28 07:58:51,804 INFO L290 TraceCheckUtils]: 69: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,804 INFO L290 TraceCheckUtils]: 68: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,805 INFO L272 TraceCheckUtils]: 66: Hoare triple {3420#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {3420#false} assume !(~c~0 < ~k~0); {3420#false} is VALID [2022-04-28 07:58:51,805 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3419#true} {3420#false} #57#return; {3420#false} is VALID [2022-04-28 07:58:51,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,805 INFO L272 TraceCheckUtils]: 60: Hoare triple {3420#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,805 INFO L290 TraceCheckUtils]: 59: Hoare triple {3420#false} assume !false; {3420#false} is VALID [2022-04-28 07:58:51,805 INFO L290 TraceCheckUtils]: 58: Hoare triple {3703#(not (< main_~c~0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3420#false} is VALID [2022-04-28 07:58:51,806 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3419#true} {3703#(not (< main_~c~0 main_~k~0))} #57#return; {3703#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 07:58:51,806 INFO L290 TraceCheckUtils]: 56: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,806 INFO L290 TraceCheckUtils]: 55: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,806 INFO L272 TraceCheckUtils]: 53: Hoare triple {3703#(not (< main_~c~0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,806 INFO L290 TraceCheckUtils]: 52: Hoare triple {3703#(not (< main_~c~0 main_~k~0))} assume !false; {3703#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 07:58:51,807 INFO L290 TraceCheckUtils]: 51: Hoare triple {3725#(<= main_~k~0 (+ main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3703#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 07:58:51,808 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3419#true} {3725#(<= main_~k~0 (+ main_~c~0 1))} #57#return; {3725#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 07:58:51,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,808 INFO L272 TraceCheckUtils]: 46: Hoare triple {3725#(<= main_~k~0 (+ main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,809 INFO L290 TraceCheckUtils]: 45: Hoare triple {3725#(<= main_~k~0 (+ main_~c~0 1))} assume !false; {3725#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 07:58:51,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {3747#(<= main_~k~0 (+ main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3725#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 07:58:51,810 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3419#true} {3747#(<= main_~k~0 (+ main_~c~0 2))} #57#return; {3747#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 07:58:51,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,810 INFO L272 TraceCheckUtils]: 39: Hoare triple {3747#(<= main_~k~0 (+ main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {3747#(<= main_~k~0 (+ main_~c~0 2))} assume !false; {3747#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 07:58:51,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {3769#(<= main_~k~0 (+ main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3747#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 07:58:51,812 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3419#true} {3769#(<= main_~k~0 (+ main_~c~0 3))} #57#return; {3769#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-28 07:58:51,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,812 INFO L272 TraceCheckUtils]: 32: Hoare triple {3769#(<= main_~k~0 (+ main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {3769#(<= main_~k~0 (+ main_~c~0 3))} assume !false; {3769#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-28 07:58:51,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {3791#(<= main_~k~0 (+ main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3769#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-28 07:58:51,814 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3419#true} {3791#(<= main_~k~0 (+ main_~c~0 4))} #57#return; {3791#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-28 07:58:51,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,814 INFO L272 TraceCheckUtils]: 25: Hoare triple {3791#(<= main_~k~0 (+ main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {3791#(<= main_~k~0 (+ main_~c~0 4))} assume !false; {3791#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-28 07:58:51,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {3813#(<= main_~k~0 (+ 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3791#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-28 07:58:51,816 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3419#true} {3813#(<= main_~k~0 (+ 5 main_~c~0))} #57#return; {3813#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-28 07:58:51,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,816 INFO L272 TraceCheckUtils]: 18: Hoare triple {3813#(<= main_~k~0 (+ 5 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {3813#(<= main_~k~0 (+ 5 main_~c~0))} assume !false; {3813#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-28 07:58:51,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {3835#(<= main_~k~0 5)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3813#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-28 07:58:51,817 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3419#true} {3835#(<= main_~k~0 5)} #55#return; {3835#(<= main_~k~0 5)} is VALID [2022-04-28 07:58:51,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {3419#true} assume !(0 == ~cond); {3419#true} is VALID [2022-04-28 07:58:51,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {3419#true} ~cond := #in~cond; {3419#true} is VALID [2022-04-28 07:58:51,817 INFO L272 TraceCheckUtils]: 11: Hoare triple {3835#(<= main_~k~0 5)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,818 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3449#(not (= |assume_abort_if_not_#in~cond| 0))} {3419#true} #53#return; {3835#(<= main_~k~0 5)} is VALID [2022-04-28 07:58:51,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {3449#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3449#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:58:51,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {3863#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3449#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:58:51,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {3419#true} ~cond := #in~cond; {3863#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 07:58:51,819 INFO L272 TraceCheckUtils]: 6: Hoare triple {3419#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3419#true} is VALID [2022-04-28 07:58:51,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {3419#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; {3419#true} is VALID [2022-04-28 07:58:51,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {3419#true} call #t~ret5 := main(); {3419#true} is VALID [2022-04-28 07:58:51,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3419#true} {3419#true} #63#return; {3419#true} is VALID [2022-04-28 07:58:51,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {3419#true} assume true; {3419#true} is VALID [2022-04-28 07:58:51,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {3419#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); {3419#true} is VALID [2022-04-28 07:58:51,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {3419#true} call ULTIMATE.init(); {3419#true} is VALID [2022-04-28 07:58:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-04-28 07:58:51,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:51,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176005258] [2022-04-28 07:58:51,819 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:51,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272304688] [2022-04-28 07:58:51,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272304688] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:58:51,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:58:51,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-28 07:58:51,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:51,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [97384240] [2022-04-28 07:58:51,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [97384240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:51,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:51,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:58:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914218064] [2022-04-28 07:58:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-28 07:58:51,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:51,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:58:51,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:51,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:58:51,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:51,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:58:51,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:58:51,861 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:58:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:52,120 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-28 07:58:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:58:52,120 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-28 07:58:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:58:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 07:58:52,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:58:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 07:58:52,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-28 07:58:52,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:52,170 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:58:52,170 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 07:58:52,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:58:52,171 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:52,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 132 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 07:58:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 07:58:52,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:52,172 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 07:58:52,172 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 07:58:52,172 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 07:58:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:52,172 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:58:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:58:52,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:52,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:52,172 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 07:58:52,172 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 07:58:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:52,172 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:58:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:58:52,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:52,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:52,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:52,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:52,172 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 07:58:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 07:58:52,172 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-04-28 07:58:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:52,172 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 07:58:52,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:58:52,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 07:58:52,173 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 07:58:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:58:52,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:52,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 07:58:52,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:52,379 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 07:58:52,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 07:58:53,019 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 07:58:53,019 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 07:58:53,019 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 07:58:53,019 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-28 07:58:53,019 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 07:58:53,019 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 07:58:53,019 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 07:58:53,019 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 42) the Hoare annotation is: true [2022-04-28 07:58:53,019 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)) (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)))) [2022-04-28 07:58:53,019 INFO L895 garLoopResultBuilder]: At program point L29-1(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)) (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)))) [2022-04-28 07:58:53,019 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)) (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)))) [2022-04-28 07:58:53,020 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse0 (+ (- 1) main_~y~0)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= .cse0 0) (<= main_~k~0 1) .cse1 (< 0 main_~k~0) (<= main_~c~0 1)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse1) (and (<= main_~c~0 5) (<= main_~k~0 5) (= .cse0 4) .cse1 (< 4 main_~k~0)) (and (< 3 main_~k~0) (<= main_~k~0 4) .cse1 (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4)) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) .cse1 (< 2 main_~k~0)))) [2022-04-28 07:58:53,020 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 17 42) the Hoare annotation is: true [2022-04-28 07:58:53,020 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (<= main_~k~0 5) (<= 0 main_~k~0)) [2022-04-28 07:58:53,020 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-28 07:58:53,020 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 07:58:53,020 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 17 42) the Hoare annotation is: true [2022-04-28 07:58:53,020 INFO L902 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: true [2022-04-28 07:58:53,020 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (+ (- 1) main_~y~0)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= .cse0 0) (<= main_~k~0 1) .cse1 (< 0 main_~k~0) (<= main_~c~0 1)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse1) (and (<= main_~c~0 5) (<= main_~k~0 5) (= .cse0 4) .cse1 (< 4 main_~k~0)) (and (< 3 main_~k~0) (<= main_~k~0 4) .cse1 (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4)) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) .cse1 (< 2 main_~k~0)))) [2022-04-28 07:58:53,020 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 07:58:53,020 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 07:58:53,020 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 07:58:53,020 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 07:58:53,020 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 07:58:53,020 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 07:58:53,020 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 07:58:53,020 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-28 07:58:53,020 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 07:58:53,020 INFO L895 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:58:53,020 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:58:53,020 INFO L895 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:58:53,021 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 07:58:53,024 INFO L356 BasicCegarLoop]: Path program histogram: [12, 2, 2, 2] [2022-04-28 07:58:53,025 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 07:58:53,027 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 07:58:53,029 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 07:58:53,072 INFO L163 areAnnotationChecker]: CFG has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 07:58:53,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 07:58:53 BoogieIcfgContainer [2022-04-28 07:58:53,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 07:58:53,091 INFO L158 Benchmark]: Toolchain (without parser) took 14112.38ms. Allocated memory was 185.6MB in the beginning and 345.0MB in the end (delta: 159.4MB). Free memory was 132.9MB in the beginning and 149.2MB in the end (delta: -16.3MB). Peak memory consumption was 144.1MB. Max. memory is 8.0GB. [2022-04-28 07:58:53,091 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory was 149.1MB in the beginning and 149.1MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 07:58:53,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.12ms. Allocated memory was 185.6MB in the beginning and 287.3MB in the end (delta: 101.7MB). Free memory was 132.6MB in the beginning and 262.4MB in the end (delta: -129.8MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-04-28 07:58:53,092 INFO L158 Benchmark]: Boogie Preprocessor took 20.87ms. Allocated memory is still 287.3MB. Free memory was 262.4MB in the beginning and 260.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 07:58:53,092 INFO L158 Benchmark]: RCFGBuilder took 261.94ms. Allocated memory is still 287.3MB. Free memory was 260.8MB in the beginning and 249.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 07:58:53,092 INFO L158 Benchmark]: TraceAbstraction took 13626.66ms. Allocated memory was 287.3MB in the beginning and 345.0MB in the end (delta: 57.7MB). Free memory was 248.8MB in the beginning and 149.2MB in the end (delta: 99.6MB). Peak memory consumption was 157.8MB. Max. memory is 8.0GB. [2022-04-28 07:58:53,093 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.10ms. Allocated memory is still 185.6MB. Free memory was 149.1MB in the beginning and 149.1MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.12ms. Allocated memory was 185.6MB in the beginning and 287.3MB in the end (delta: 101.7MB). Free memory was 132.6MB in the beginning and 262.4MB in the end (delta: -129.8MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.87ms. Allocated memory is still 287.3MB. Free memory was 262.4MB in the beginning and 260.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 261.94ms. Allocated memory is still 287.3MB. Free memory was 260.8MB in the beginning and 249.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13626.66ms. Allocated memory was 287.3MB in the beginning and 345.0MB in the end (delta: 57.7MB). Free memory was 248.8MB in the beginning and 149.2MB in the end (delta: 99.6MB). Peak memory consumption was 157.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 1323 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1038 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 765 IncrementalHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 285 mSDtfsCounter, 765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 619 GetRequests, 521 SyntacticMatches, 7 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=8, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 175 PreInvPairs, 256 NumberOfFragments, 1413 HoareAnnotationTreeSize, 175 FomulaSimplifications, 258 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 58 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((k <= 5 && 0 <= k) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && c == 0) && y == 0) || ((((y == 2 && k <= 5) && 1 < k) && c == 2) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y)) || ((((k <= 5 && y == 1) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 0 < k) && c == 1)) || ((((k <= 5 && y == 4) && c == 4) && 3 < k) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y)) || ((((k <= 5 && y == 3) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 2 < k) && c == 3)) || (((((c <= 5 && k <= 5) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 5 == y) && 5 <= c) && 4 < k) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 07:58:53,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...