/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:31:01,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:31:01,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:31:01,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:31:01,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:31:01,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:31:01,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:31:01,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:31:01,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:31:01,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:31:01,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:31:01,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:31:01,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:31:01,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:31:01,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:31:01,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:31:01,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:31:01,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:31:01,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:31:01,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:31:01,177 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:31:01,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:31:01,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:31:01,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:31:01,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:31:01,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:31:01,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:31:01,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:31:01,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:31:01,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:31:01,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:31:01,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:31:01,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:31:01,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:31:01,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:31:01,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:31:01,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:31:01,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:31:01,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:31:01,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:31:01,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:31:01,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:31:01,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:31:01,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:31:01,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:31:01,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:31:01,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:31:01,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:31:01,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:31:01,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:31:01,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:31:01,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:31:01,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:31:01,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:31:01,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:31:01,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:31:01,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:31:01,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:31:01,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:31:01,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:31:01,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:31:01,207 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:31:01,208 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:31:01,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:31:01,208 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:31:01,208 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:31:01,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:31:01,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:31:01,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:31:01,453 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:31:01,454 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:31:01,455 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c [2022-04-08 14:31:01,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08af94423/e175ede42f7c430c930a1a26ea2351ec/FLAG666c81940 [2022-04-08 14:31:01,820 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:31:01,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c [2022-04-08 14:31:01,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08af94423/e175ede42f7c430c930a1a26ea2351ec/FLAG666c81940 [2022-04-08 14:31:02,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08af94423/e175ede42f7c430c930a1a26ea2351ec [2022-04-08 14:31:02,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:31:02,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:31:02,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:31:02,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:31:02,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:31:02,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:31:02" (1/1) ... [2022-04-08 14:31:02,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784494d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:02, skipping insertion in model container [2022-04-08 14:31:02,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:31:02" (1/1) ... [2022-04-08 14:31:02,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:31:02,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:31:02,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c[458,471] [2022-04-08 14:31:02,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:31:02,401 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:31:02,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c[458,471] [2022-04-08 14:31:02,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:31:02,439 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:31:02,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:02 WrapperNode [2022-04-08 14:31:02,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:31:02,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:31:02,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:31:02,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:31:02,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:02" (1/1) ... [2022-04-08 14:31:02,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:02" (1/1) ... [2022-04-08 14:31:02,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:02" (1/1) ... [2022-04-08 14:31:02,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:02" (1/1) ... [2022-04-08 14:31:02,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:02" (1/1) ... [2022-04-08 14:31:02,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:02" (1/1) ... [2022-04-08 14:31:02,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:02" (1/1) ... [2022-04-08 14:31:02,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:31:02,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:31:02,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:31:02,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:31:02,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:02" (1/1) ... [2022-04-08 14:31:02,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:31:02,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:02,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:31:02,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:31:02,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:31:02,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:31:02,550 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:31:02,550 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:31:02,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:31:02,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:31:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:31:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:31:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:31:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:31:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 14:31:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:31:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:31:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:31:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:31:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:31:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:31:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:31:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:31:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:31:02,611 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:31:02,613 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:31:02,764 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:31:02,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:31:02,776 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:31:02,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:31:02 BoogieIcfgContainer [2022-04-08 14:31:02,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:31:02,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:31:02,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:31:02,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:31:02,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:31:02" (1/3) ... [2022-04-08 14:31:02,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c05718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:31:02, skipping insertion in model container [2022-04-08 14:31:02,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:02" (2/3) ... [2022-04-08 14:31:02,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c05718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:31:02, skipping insertion in model container [2022-04-08 14:31:02,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:31:02" (3/3) ... [2022-04-08 14:31:02,805 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound5.c [2022-04-08 14:31:02,810 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:31:02,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:31:02,841 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:31:02,847 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:31:02,847 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:31:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:31:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:31:02,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:02,870 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:02,871 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:02,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:02,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-08 14:31:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:02,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1202814877] [2022-04-08 14:31:02,899 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-08 14:31:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:02,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684993943] [2022-04-08 14:31:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:02,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:03,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:31:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:03,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-08 14:31:03,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:31:03,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 14:31:03,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:31:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:03,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:31:03,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:31:03,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:31:03,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:31:03,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 14:31:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:03,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:31:03,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:31:03,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:31:03,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 14:31:03,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:31:03,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-08 14:31:03,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:31:03,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 14:31:03,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-08 14:31:03,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-08 14:31:03,165 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-08 14:31:03,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:31:03,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:31:03,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:31:03,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:31:03,166 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-08 14:31:03,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:31:03,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:31:03,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:31:03,167 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 14:31:03,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-08 14:31:03,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-08 14:31:03,168 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-08 14:31:03,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 14:31:03,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 14:31:03,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 14:31:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:31:03,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:03,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684993943] [2022-04-08 14:31:03,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684993943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:03,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:03,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:31:03,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:03,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1202814877] [2022-04-08 14:31:03,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1202814877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:03,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:03,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:31:03,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103627899] [2022-04-08 14:31:03,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:03,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:31:03,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:03,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:31:03,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:03,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:31:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:03,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:31:03,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:31:03,228 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:31:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:03,323 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 14:31:03,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:31:03,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:31:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:31:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 14:31:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:31:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 14:31:03,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-08 14:31:03,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:03,424 INFO L225 Difference]: With dead ends: 51 [2022-04-08 14:31:03,424 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 14:31:03,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:31:03,429 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:31:03,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:31:03,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 14:31:03,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 14:31:03,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:03,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:31:03,462 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:31:03,462 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:31:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:03,468 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 14:31:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:31:03,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:03,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:03,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 14:31:03,470 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 14:31:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:03,473 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 14:31:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:31:03,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:03,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:03,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:03,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:31:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 14:31:03,479 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-08 14:31:03,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:03,479 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 14:31:03,480 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:31:03,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 14:31:03,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:31:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:31:03,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:03,512 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:03,513 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:31:03,513 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:03,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:03,514 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-08 14:31:03,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:03,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1581978055] [2022-04-08 14:31:03,515 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-08 14:31:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:03,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489397788] [2022-04-08 14:31:03,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:03,540 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:03,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350045253] [2022-04-08 14:31:03,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:03,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:03,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:03,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:31:03,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 14:31:03,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:31:03,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:03,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:31:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:03,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:03,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-08 14:31:03,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-04-08 14:31:03,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:31:03,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-08 14:31:03,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-08 14:31:03,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {246#true} is VALID [2022-04-08 14:31:03,845 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-08 14:31:03,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 14:31:03,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 14:31:03,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:31:03,848 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-08 14:31:03,848 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-08 14:31:03,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 14:31:03,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 14:31:03,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:31:03,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-08 14:31:03,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:03,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:03,858 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:31:03,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:03,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-08 14:31:03,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-08 14:31:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:31:03,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:31:03,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:03,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489397788] [2022-04-08 14:31:03,861 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:03,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350045253] [2022-04-08 14:31:03,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350045253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:03,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:03,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:31:03,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:03,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1581978055] [2022-04-08 14:31:03,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1581978055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:03,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:03,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:31:03,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562846573] [2022-04-08 14:31:03,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:03,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 14:31:03,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:03,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:31:03,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:03,891 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:31:03,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:03,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:31:03,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:31:03,892 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:31:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:04,031 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 14:31:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:31:04,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 14:31:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:31:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 14:31:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:31:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 14:31:04,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 14:31:04,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:04,087 INFO L225 Difference]: With dead ends: 35 [2022-04-08 14:31:04,087 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 14:31:04,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:31:04,092 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:31:04,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:31:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 14:31:04,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 14:31:04,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:04,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:31:04,115 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:31:04,116 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:31:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:04,120 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 14:31:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:31:04,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:04,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:04,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 14:31:04,123 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 14:31:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:04,127 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 14:31:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:31:04,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:04,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:04,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:04,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:31:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-08 14:31:04,136 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-08 14:31:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:04,137 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-08 14:31:04,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:31:04,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-08 14:31:04,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:31:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:31:04,184 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:04,184 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:04,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 14:31:04,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:04,408 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:04,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-08 14:31:04,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:04,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [95314908] [2022-04-08 14:31:04,409 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:04,409 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-08 14:31:04,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:04,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161183094] [2022-04-08 14:31:04,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:04,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:04,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:04,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547548670] [2022-04-08 14:31:04,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:04,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:04,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:04,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:31:04,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 14:31:04,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:31:04,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:04,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:31:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:04,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:04,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 14:31:04,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-08 14:31:04,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:31:04,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 14:31:04,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 14:31:04,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-08 14:31:04,671 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-08 14:31:04,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:31:04,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:31:04,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:31:04,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 14:31:04,672 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 14:31:04,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:31:04,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:31:04,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:31:04,672 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 14:31:04,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:04,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:04,674 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-08 14:31:04,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:31:04,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:31:04,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:31:04,675 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:04,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 14:31:04,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !false; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 14:31:04,677 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:31:04,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:04,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 14:31:04,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 14:31:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:31:04,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:04,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 14:31:04,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 14:31:04,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:04,897 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:31:04,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:31:06,912 WARN L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-08 14:31:06,913 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #57#return; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:31:06,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:31:06,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:31:06,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:31:06,914 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-08 14:31:06,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:31:06,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:31:06,932 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 14:31:06,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:31:06,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:31:06,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:31:06,933 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 14:31:06,933 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 14:31:06,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:31:06,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:31:06,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:31:06,934 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-08 14:31:06,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-08 14:31:06,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 14:31:06,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 14:31:06,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:31:06,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-08 14:31:06,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 14:31:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 14:31:06,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:06,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161183094] [2022-04-08 14:31:06,935 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:06,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547548670] [2022-04-08 14:31:06,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547548670] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:06,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:06,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:31:06,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:06,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [95314908] [2022-04-08 14:31:06,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [95314908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:06,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:06,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:31:06,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283538280] [2022-04-08 14:31:06,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:06,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 14:31:06,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:06,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:31:07,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:07,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:31:07,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:31:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:31:07,424 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:31:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:07,562 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 14:31:07,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:31:07,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 14:31:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:31:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:31:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:31:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:31:07,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 14:31:10,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:10,294 INFO L225 Difference]: With dead ends: 37 [2022-04-08 14:31:10,294 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 14:31:10,295 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:31:10,296 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:31:10,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:31:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 14:31:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 14:31:10,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:10,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:31:10,321 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:31:10,321 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:31:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:10,323 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 14:31:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:31:10,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:10,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:10,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 14:31:10,324 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 14:31:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:10,326 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 14:31:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:31:10,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:10,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:10,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:10,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:31:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-08 14:31:10,328 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-08 14:31:10,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:10,328 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-08 14:31:10,329 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:31:10,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-08 14:31:10,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:31:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 14:31:10,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:10,642 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:10,660 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-08 14:31:10,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 14:31:10,843 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:10,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-08 14:31:10,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:10,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105782356] [2022-04-08 14:31:10,844 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:10,844 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-08 14:31:10,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:10,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402607645] [2022-04-08 14:31:10,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:10,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:10,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:10,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656378048] [2022-04-08 14:31:10,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:10,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:10,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:31:10,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 14:31:10,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:31:10,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:10,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:31:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:10,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:11,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-08 14:31:11,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {900#true} is VALID [2022-04-08 14:31:11,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:31:11,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-08 14:31:11,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-08 14:31:11,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {900#true} is VALID [2022-04-08 14:31:11,320 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-08 14:31:11,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:31:11,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:31:11,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:31:11,331 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-08 14:31:11,331 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-08 14:31:11,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:31:11,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:31:11,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:31:11,332 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-08 14:31:11,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:11,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:11,333 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:31:11,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:31:11,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:31:11,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:31:11,335 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:11,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:31:11,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:31:11,336 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:31:11,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:31:11,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:31:11,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:31:11,338 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:31:11,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:31:11,339 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:31:11,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:31:11,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:31:11,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:31:11,340 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:31:11,341 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:31:11,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:11,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-08 14:31:11,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-08 14:31:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 14:31:11,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:11,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:11,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402607645] [2022-04-08 14:31:11,687 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:11,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656378048] [2022-04-08 14:31:11,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656378048] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:11,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:11,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 14:31:11,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:11,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105782356] [2022-04-08 14:31:11,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105782356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:11,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:11,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:31:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133516267] [2022-04-08 14:31:11,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:11,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 14:31:11,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:11,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:31:11,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:11,721 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:31:11,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:11,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:31:11,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:31:11,723 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:31:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:12,012 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 14:31:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:31:12,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 14:31:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:31:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 14:31:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:31:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 14:31:12,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-08 14:31:12,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:12,054 INFO L225 Difference]: With dead ends: 42 [2022-04-08 14:31:12,054 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 14:31:12,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:31:12,056 INFO L913 BasicCegarLoop]: 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-08 14:31:12,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:31:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 14:31:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 14:31:12,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:12,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:31:12,076 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:31:12,078 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:31:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:12,080 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 14:31:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:31:12,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:12,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:12,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 14:31:12,082 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 14:31:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:12,083 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 14:31:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:31:12,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:12,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:12,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:12,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:31:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-08 14:31:12,086 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-08 14:31:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:12,086 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-08 14:31:12,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:31:12,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-08 14:31:12,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:31:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 14:31:12,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:12,615 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:12,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 14:31:12,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:12,815 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-08 14:31:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:12,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2007057700] [2022-04-08 14:31:12,817 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:12,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-08 14:31:12,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:12,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860825954] [2022-04-08 14:31:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:12,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:12,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:12,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703482921] [2022-04-08 14:31:12,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:31:12,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:12,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:31:12,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 14:31:12,877 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:31:12,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:12,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:31:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:12,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:13,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-08 14:31:13,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1315#true} is VALID [2022-04-08 14:31:13,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:31:13,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-08 14:31:13,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-08 14:31:13,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1315#true} is VALID [2022-04-08 14:31:13,257 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-08 14:31:13,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:31:13,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:31:13,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:31:13,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-08 14:31:13,257 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:31:13,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:31:13,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:31:13,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:31:13,258 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-08 14:31:13,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:13,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:13,259 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:31:13,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:31:13,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:31:13,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:31:13,261 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:13,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:31:13,263 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-08 14:31:13,263 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:31:13,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:31:13,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:31:13,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:31:13,264 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-08 14:31:13,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:31:13,265 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-08 14:31:13,265 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:31:13,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:31:13,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:31:13,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:31:13,269 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-08 14:31:13,270 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-08 14:31:13,270 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:31:13,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:31:13,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:31:13,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:31:13,271 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-08 14:31:13,271 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-08 14:31:13,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:13,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-08 14:31:13,275 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-08 14:31:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 14:31:13,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:13,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860825954] [2022-04-08 14:31:13,703 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:13,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703482921] [2022-04-08 14:31:13,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703482921] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:13,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:13,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 14:31:13,704 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:13,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2007057700] [2022-04-08 14:31:13,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2007057700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:13,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:13,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:31:13,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186863245] [2022-04-08 14:31:13,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:13,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 14:31:13,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:13,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:31:13,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:13,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:31:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:13,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:31:13,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:31:13,732 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:31:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:14,070 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 14:31:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:31:14,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 14:31:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:31:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 14:31:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:31:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 14:31:14,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-08 14:31:14,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:14,120 INFO L225 Difference]: With dead ends: 45 [2022-04-08 14:31:14,120 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 14:31:14,120 INFO L912 BasicCegarLoop]: 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-08 14:31:14,121 INFO L913 BasicCegarLoop]: 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-08 14:31:14,121 INFO L914 BasicCegarLoop]: 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-08 14:31:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 14:31:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 14:31:14,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:14,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:31:14,146 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:31:14,146 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:31:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:14,150 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 14:31:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:31:14,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:14,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:14,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 14:31:14,151 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 14:31:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:14,155 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 14:31:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:31:14,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:14,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:14,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:14,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:31:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-08 14:31:14,159 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-08 14:31:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:14,161 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-08 14:31:14,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:31:14,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-08 14:31:14,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:31:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 14:31:14,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:14,460 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:14,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 14:31:14,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:14,671 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-08 14:31:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:14,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [810957513] [2022-04-08 14:31:14,672 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-08 14:31:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:14,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335847775] [2022-04-08 14:31:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:14,688 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:14,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1167601333] [2022-04-08 14:31:14,688 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:31:14,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:14,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:14,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:31:14,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 14:31:15,299 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:31:15,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:15,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 14:31:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:15,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:15,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {1792#true} call ULTIMATE.init(); {1792#true} is VALID [2022-04-08 14:31:15,708 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-08 14:31:15,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:31:15,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #63#return; {1792#true} is VALID [2022-04-08 14:31:15,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret5 := main(); {1792#true} is VALID [2022-04-08 14:31:15,708 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-08 14:31:15,708 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-08 14:31:15,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:31:15,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:31:15,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:31:15,709 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1792#true} {1792#true} #53#return; {1792#true} is VALID [2022-04-08 14:31:15,709 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-08 14:31:15,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:31:15,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:31:15,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:31:15,709 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1792#true} {1792#true} #55#return; {1792#true} is VALID [2022-04-08 14:31:15,710 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-08 14:31:15,710 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-08 14:31:15,710 INFO L272 TraceCheckUtils]: 18: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:31:15,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:31:15,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:31:15,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:31:15,711 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-08 14:31:15,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:31:15,712 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-08 14:31:15,712 INFO L272 TraceCheckUtils]: 25: Hoare triple {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:31:15,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:31:15,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:31:15,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:31:15,713 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-08 14:31:15,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:31:15,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:31:15,714 INFO L272 TraceCheckUtils]: 32: Hoare triple {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:31:15,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:31:15,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:31:15,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:31:15,715 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1792#true} {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:31:15,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:31:15,716 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-08 14:31:15,716 INFO L272 TraceCheckUtils]: 39: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:31:15,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:31:15,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:31:15,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:31:15,717 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-08 14:31:15,718 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-08 14:31:15,718 INFO L272 TraceCheckUtils]: 45: Hoare triple {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:31:15,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:31:15,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:31:15,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:31:15,719 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-08 14:31:15,720 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-08 14:31:15,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {1952#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1956#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:15,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {1956#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1793#false} is VALID [2022-04-08 14:31:15,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-04-08 14:31:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 14:31:15,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:16,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335847775] [2022-04-08 14:31:16,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:16,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167601333] [2022-04-08 14:31:16,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167601333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:16,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:16,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 14:31:16,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:16,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [810957513] [2022-04-08 14:31:16,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [810957513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:16,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:16,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:31:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328766411] [2022-04-08 14:31:16,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:16,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 14:31:16,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:16,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:31:16,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:16,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:31:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:31:16,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:31:16,117 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:31:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:16,519 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 14:31:16,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 14:31:16,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 14:31:16,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:31:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 14:31:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:31:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 14:31:16,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-08 14:31:16,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:16,562 INFO L225 Difference]: With dead ends: 48 [2022-04-08 14:31:16,562 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 14:31:16,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:31:16,563 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:31:16,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:31:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 14:31:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 14:31:16,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:16,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:31:16,595 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:31:16,596 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:31:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:16,598 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 14:31:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 14:31:16,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:16,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:16,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-08 14:31:16,600 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-08 14:31:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:16,604 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 14:31:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 14:31:16,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:16,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:16,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:16,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:31:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-08 14:31:16,608 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-08 14:31:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:16,608 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-08 14:31:16,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:31:16,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-08 14:31:17,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 14:31:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 14:31:17,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:17,075 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:17,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 14:31:17,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:17,279 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times [2022-04-08 14:31:17,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:17,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1804240259] [2022-04-08 14:31:17,280 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times [2022-04-08 14:31:17,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:17,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606872459] [2022-04-08 14:31:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:17,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:17,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2004560627] [2022-04-08 14:31:17,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:17,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:17,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:17,305 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:31:17,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 14:31:18,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:31:18,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:18,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 14:31:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:18,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:18,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {2287#true} call ULTIMATE.init(); {2287#true} is VALID [2022-04-08 14:31:18,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {2287#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2287#true} is VALID [2022-04-08 14:31:18,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:31:18,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2287#true} {2287#true} #63#return; {2287#true} is VALID [2022-04-08 14:31:18,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {2287#true} call #t~ret5 := main(); {2287#true} is VALID [2022-04-08 14:31:18,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {2287#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2287#true} is VALID [2022-04-08 14:31:18,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {2287#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:31:18,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:31:18,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:31:18,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:31:18,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2287#true} {2287#true} #53#return; {2287#true} is VALID [2022-04-08 14:31:18,541 INFO L272 TraceCheckUtils]: 11: Hoare triple {2287#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:31:18,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:31:18,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:31:18,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:31:18,541 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2287#true} {2287#true} #55#return; {2287#true} is VALID [2022-04-08 14:31:18,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {2287#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:18,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {2340#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:18,543 INFO L272 TraceCheckUtils]: 18: Hoare triple {2340#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:31:18,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:31:18,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:31:18,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:31:18,544 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2287#true} {2340#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:18,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {2340#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:31:18,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:31:18,545 INFO L272 TraceCheckUtils]: 25: Hoare triple {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:31:18,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:31:18,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:31:18,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:31:18,546 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2287#true} {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:31:18,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:31:18,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:31:18,547 INFO L272 TraceCheckUtils]: 32: Hoare triple {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:31:18,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:31:18,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:31:18,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:31:18,548 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2287#true} {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:31:18,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:31:18,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {2406#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:31:18,549 INFO L272 TraceCheckUtils]: 39: Hoare triple {2406#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:31:18,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:31:18,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:31:18,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:31:18,550 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2287#true} {2406#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:31:18,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:31:18,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:31:18,551 INFO L272 TraceCheckUtils]: 46: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:31:18,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:31:18,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:31:18,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:31:18,553 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2287#true} {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:31:18,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:31:18,553 INFO L272 TraceCheckUtils]: 52: Hoare triple {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:31:18,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:31:18,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:31:18,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:31:18,554 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2287#true} {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:31:18,555 INFO L272 TraceCheckUtils]: 57: Hoare triple {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2469#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:31:18,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {2469#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2473#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:18,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {2473#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2288#false} is VALID [2022-04-08 14:31:18,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {2288#false} assume !false; {2288#false} is VALID [2022-04-08 14:31:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 14:31:18,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:18,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606872459] [2022-04-08 14:31:18,878 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:18,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004560627] [2022-04-08 14:31:18,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004560627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:18,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:18,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 14:31:18,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:18,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1804240259] [2022-04-08 14:31:18,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1804240259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:18,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:18,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:31:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029536594] [2022-04-08 14:31:18,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:18,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 14:31:18,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:18,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:31:18,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:18,914 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:31:18,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:18,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:31:18,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 14:31:18,914 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:31:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:19,369 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-08 14:31:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:31:19,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 14:31:19,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:31:19,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 14:31:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:31:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 14:31:19,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-08 14:31:19,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:19,418 INFO L225 Difference]: With dead ends: 51 [2022-04-08 14:31:19,418 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 14:31:19,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:31:19,419 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:31:19,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:31:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 14:31:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 14:31:19,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:19,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:31:19,444 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:31:19,445 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:31:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:19,446 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 14:31:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 14:31:19,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:19,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:19,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 14:31:19,447 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 14:31:19,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:19,449 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 14:31:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 14:31:19,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:19,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:19,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:19,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:31:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-08 14:31:19,451 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-08 14:31:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:19,452 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-08 14:31:19,452 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:31:19,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-08 14:31:19,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 14:31:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 14:31:19,701 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:19,701 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:19,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 14:31:19,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:19,908 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times [2022-04-08 14:31:19,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:19,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1924769128] [2022-04-08 14:31:19,908 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times [2022-04-08 14:31:19,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:19,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881745759] [2022-04-08 14:31:19,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:19,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:19,920 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:19,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46534181] [2022-04-08 14:31:19,920 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:31:19,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:19,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:19,921 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:31:19,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 14:31:19,963 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:31:19,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:19,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 14:31:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:19,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:20,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {2822#true} call ULTIMATE.init(); {2822#true} is VALID [2022-04-08 14:31:20,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2822#true} is VALID [2022-04-08 14:31:20,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:31:20,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2822#true} #63#return; {2822#true} is VALID [2022-04-08 14:31:20,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {2822#true} call #t~ret5 := main(); {2822#true} is VALID [2022-04-08 14:31:20,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {2822#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2822#true} is VALID [2022-04-08 14:31:20,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {2822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:31:20,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:31:20,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:31:20,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:31:20,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2822#true} {2822#true} #53#return; {2822#true} is VALID [2022-04-08 14:31:20,371 INFO L272 TraceCheckUtils]: 11: Hoare triple {2822#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:31:20,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:31:20,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:31:20,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:31:20,372 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2822#true} {2822#true} #55#return; {2822#true} is VALID [2022-04-08 14:31:20,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {2822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:20,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {2875#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:20,375 INFO L272 TraceCheckUtils]: 18: Hoare triple {2875#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:31:20,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:31:20,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:31:20,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:31:20,384 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2822#true} {2875#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:20,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {2875#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:31:20,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:31:20,385 INFO L272 TraceCheckUtils]: 25: Hoare triple {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:31:20,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:31:20,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:31:20,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:31:20,386 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2822#true} {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:31:20,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:31:20,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:31:20,386 INFO L272 TraceCheckUtils]: 32: Hoare triple {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:31:20,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:31:20,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:31:20,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:31:20,387 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2822#true} {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:31:20,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:31:20,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:31:20,388 INFO L272 TraceCheckUtils]: 39: Hoare triple {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:31:20,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:31:20,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:31:20,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:31:20,389 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2822#true} {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:31:20,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:31:20,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:31:20,389 INFO L272 TraceCheckUtils]: 46: Hoare triple {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:31:20,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:31:20,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:31:20,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:31:20,390 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2822#true} {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:31:20,391 INFO L290 TraceCheckUtils]: 51: Hoare triple {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:31:20,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:31:20,391 INFO L272 TraceCheckUtils]: 53: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:31:20,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:31:20,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:31:20,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:31:20,392 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2822#true} {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:31:20,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:31:20,392 INFO L272 TraceCheckUtils]: 59: Hoare triple {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:31:20,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:31:20,392 INFO L290 TraceCheckUtils]: 61: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:31:20,393 INFO L290 TraceCheckUtils]: 62: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:31:20,397 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2822#true} {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #59#return; {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:31:20,398 INFO L272 TraceCheckUtils]: 64: Hoare triple {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:31:20,398 INFO L290 TraceCheckUtils]: 65: Hoare triple {3026#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:20,399 INFO L290 TraceCheckUtils]: 66: Hoare triple {3030#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2823#false} is VALID [2022-04-08 14:31:20,399 INFO L290 TraceCheckUtils]: 67: Hoare triple {2823#false} assume !false; {2823#false} is VALID [2022-04-08 14:31:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 14:31:20,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:20,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:20,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881745759] [2022-04-08 14:31:20,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:20,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46534181] [2022-04-08 14:31:20,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46534181] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:20,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:20,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 14:31:20,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:20,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1924769128] [2022-04-08 14:31:20,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1924769128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:20,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:20,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:31:20,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307164748] [2022-04-08 14:31:20,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:20,681 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 14:31:20,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:20,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:31:20,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:20,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:31:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:20,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:31:20,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:31:20,718 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:31:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:21,294 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 14:31:21,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 14:31:21,295 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 14:31:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:31:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 14:31:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:31:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 14:31:21,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-08 14:31:21,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:21,348 INFO L225 Difference]: With dead ends: 54 [2022-04-08 14:31:21,348 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 14:31:21,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:31:21,349 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:31:21,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:31:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 14:31:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-08 14:31:21,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:21,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:31:21,375 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:31:21,376 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:31:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:21,377 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 14:31:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 14:31:21,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:21,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:21,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-08 14:31:21,378 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-08 14:31:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:21,380 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 14:31:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 14:31:21,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:21,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:21,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:21,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:31:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-08 14:31:21,382 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-08 14:31:21,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:21,382 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-08 14:31:21,383 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:31:21,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-08 14:31:21,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 14:31:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 14:31:21,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:21,735 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:21,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 14:31:21,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:21,939 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times [2022-04-08 14:31:21,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:21,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [196736688] [2022-04-08 14:31:21,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times [2022-04-08 14:31:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:21,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347437103] [2022-04-08 14:31:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:21,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:21,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784949981] [2022-04-08 14:31:21,952 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:31:21,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:21,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:21,953 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:31:21,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 14:31:23,706 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:31:23,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:23,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:31:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:23,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:24,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2022-04-08 14:31:24,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {3397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3397#true} is VALID [2022-04-08 14:31:24,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #63#return; {3397#true} is VALID [2022-04-08 14:31:24,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret5 := main(); {3397#true} is VALID [2022-04-08 14:31:24,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {3397#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3397#true} is VALID [2022-04-08 14:31:24,290 INFO L272 TraceCheckUtils]: 6: Hoare triple {3397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {3397#true} ~cond := #in~cond; {3423#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:31:24,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {3423#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:31:24,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {3427#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:31:24,292 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3427#(not (= |assume_abort_if_not_#in~cond| 0))} {3397#true} #53#return; {3434#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-08 14:31:24,292 INFO L272 TraceCheckUtils]: 11: Hoare triple {3434#(and (<= main_~k~0 5) (<= 0 main_~k~0))} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,293 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3397#true} {3434#(and (<= main_~k~0 5) (<= 0 main_~k~0))} #55#return; {3434#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-08 14:31:24,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {3434#(and (<= main_~k~0 5) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-08 14:31:24,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-08 14:31:24,294 INFO L272 TraceCheckUtils]: 18: Hoare triple {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,295 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3397#true} {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} #57#return; {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-08 14:31:24,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-08 14:31:24,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !false; {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-08 14:31:24,296 INFO L272 TraceCheckUtils]: 25: Hoare triple {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,301 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3397#true} {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} #57#return; {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-08 14:31:24,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 14:31:24,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 14:31:24,302 INFO L272 TraceCheckUtils]: 32: Hoare triple {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,303 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3397#true} {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} #57#return; {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-08 14:31:24,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-08 14:31:24,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-08 14:31:24,304 INFO L272 TraceCheckUtils]: 39: Hoare triple {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,305 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3397#true} {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} #57#return; {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-08 14:31:24,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-08 14:31:24,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-08 14:31:24,306 INFO L272 TraceCheckUtils]: 46: Hoare triple {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,306 INFO L290 TraceCheckUtils]: 49: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,307 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3397#true} {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} #57#return; {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-08 14:31:24,307 INFO L290 TraceCheckUtils]: 51: Hoare triple {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-08 14:31:24,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-08 14:31:24,308 INFO L272 TraceCheckUtils]: 53: Hoare triple {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,308 INFO L290 TraceCheckUtils]: 55: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,308 INFO L290 TraceCheckUtils]: 56: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,308 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3397#true} {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} #57#return; {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-08 14:31:24,309 INFO L290 TraceCheckUtils]: 58: Hoare triple {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3398#false} is VALID [2022-04-08 14:31:24,309 INFO L290 TraceCheckUtils]: 59: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-08 14:31:24,309 INFO L272 TraceCheckUtils]: 60: Hoare triple {3398#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3398#false} is VALID [2022-04-08 14:31:24,309 INFO L290 TraceCheckUtils]: 61: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2022-04-08 14:31:24,309 INFO L290 TraceCheckUtils]: 62: Hoare triple {3398#false} assume !(0 == ~cond); {3398#false} is VALID [2022-04-08 14:31:24,309 INFO L290 TraceCheckUtils]: 63: Hoare triple {3398#false} assume true; {3398#false} is VALID [2022-04-08 14:31:24,309 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3398#false} {3398#false} #57#return; {3398#false} is VALID [2022-04-08 14:31:24,310 INFO L290 TraceCheckUtils]: 65: Hoare triple {3398#false} assume !(~c~0 < ~k~0); {3398#false} is VALID [2022-04-08 14:31:24,310 INFO L272 TraceCheckUtils]: 66: Hoare triple {3398#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3398#false} is VALID [2022-04-08 14:31:24,310 INFO L290 TraceCheckUtils]: 67: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2022-04-08 14:31:24,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {3398#false} assume !(0 == ~cond); {3398#false} is VALID [2022-04-08 14:31:24,310 INFO L290 TraceCheckUtils]: 69: Hoare triple {3398#false} assume true; {3398#false} is VALID [2022-04-08 14:31:24,310 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3398#false} {3398#false} #59#return; {3398#false} is VALID [2022-04-08 14:31:24,310 INFO L272 TraceCheckUtils]: 71: Hoare triple {3398#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3398#false} is VALID [2022-04-08 14:31:24,310 INFO L290 TraceCheckUtils]: 72: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2022-04-08 14:31:24,310 INFO L290 TraceCheckUtils]: 73: Hoare triple {3398#false} assume 0 == ~cond; {3398#false} is VALID [2022-04-08 14:31:24,310 INFO L290 TraceCheckUtils]: 74: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-08 14:31:24,311 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-08 14:31:24,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:24,742 INFO L290 TraceCheckUtils]: 74: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-08 14:31:24,742 INFO L290 TraceCheckUtils]: 73: Hoare triple {3398#false} assume 0 == ~cond; {3398#false} is VALID [2022-04-08 14:31:24,742 INFO L290 TraceCheckUtils]: 72: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2022-04-08 14:31:24,742 INFO L272 TraceCheckUtils]: 71: Hoare triple {3398#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3398#false} is VALID [2022-04-08 14:31:24,742 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3397#true} {3398#false} #59#return; {3398#false} is VALID [2022-04-08 14:31:24,742 INFO L290 TraceCheckUtils]: 69: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,743 INFO L290 TraceCheckUtils]: 68: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,743 INFO L290 TraceCheckUtils]: 67: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,743 INFO L272 TraceCheckUtils]: 66: Hoare triple {3398#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {3398#false} assume !(~c~0 < ~k~0); {3398#false} is VALID [2022-04-08 14:31:24,743 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3397#true} {3398#false} #57#return; {3398#false} is VALID [2022-04-08 14:31:24,743 INFO L290 TraceCheckUtils]: 63: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,743 INFO L272 TraceCheckUtils]: 60: Hoare triple {3398#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-08 14:31:24,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {3681#(not (< main_~c~0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3398#false} is VALID [2022-04-08 14:31:24,745 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3397#true} {3681#(not (< main_~c~0 main_~k~0))} #57#return; {3681#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-08 14:31:24,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,745 INFO L290 TraceCheckUtils]: 55: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,745 INFO L272 TraceCheckUtils]: 53: Hoare triple {3681#(not (< main_~c~0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {3681#(not (< main_~c~0 main_~k~0))} assume !false; {3681#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-08 14:31:24,746 INFO L290 TraceCheckUtils]: 51: Hoare triple {3703#(<= main_~k~0 (+ main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3681#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-08 14:31:24,747 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3397#true} {3703#(<= main_~k~0 (+ main_~c~0 1))} #57#return; {3703#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-08 14:31:24,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,747 INFO L272 TraceCheckUtils]: 46: Hoare triple {3703#(<= main_~k~0 (+ main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {3703#(<= main_~k~0 (+ main_~c~0 1))} assume !false; {3703#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-08 14:31:24,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {3725#(<= main_~k~0 (+ main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3703#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-08 14:31:24,749 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3397#true} {3725#(<= main_~k~0 (+ main_~c~0 2))} #57#return; {3725#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-08 14:31:24,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,750 INFO L272 TraceCheckUtils]: 39: Hoare triple {3725#(<= main_~k~0 (+ main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {3725#(<= main_~k~0 (+ main_~c~0 2))} assume !false; {3725#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-08 14:31:24,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {3747#(<= main_~k~0 (+ main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3725#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-08 14:31:24,751 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3397#true} {3747#(<= main_~k~0 (+ main_~c~0 3))} #57#return; {3747#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-08 14:31:24,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,751 INFO L272 TraceCheckUtils]: 32: Hoare triple {3747#(<= main_~k~0 (+ main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {3747#(<= main_~k~0 (+ main_~c~0 3))} assume !false; {3747#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-08 14:31:24,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {3769#(<= main_~k~0 (+ main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3747#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-08 14:31:24,753 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3397#true} {3769#(<= main_~k~0 (+ main_~c~0 4))} #57#return; {3769#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-08 14:31:24,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,753 INFO L272 TraceCheckUtils]: 25: Hoare triple {3769#(<= main_~k~0 (+ main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {3769#(<= main_~k~0 (+ main_~c~0 4))} assume !false; {3769#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-08 14:31:24,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {3791#(<= main_~k~0 (+ 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3769#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-08 14:31:24,756 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3397#true} {3791#(<= main_~k~0 (+ 5 main_~c~0))} #57#return; {3791#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-08 14:31:24,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,756 INFO L272 TraceCheckUtils]: 18: Hoare triple {3791#(<= main_~k~0 (+ 5 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {3791#(<= main_~k~0 (+ 5 main_~c~0))} assume !false; {3791#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-08 14:31:24,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {3813#(<= main_~k~0 5)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3791#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-08 14:31:24,759 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3397#true} {3813#(<= main_~k~0 5)} #55#return; {3813#(<= main_~k~0 5)} is VALID [2022-04-08 14:31:24,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:31:24,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:31:24,759 INFO L272 TraceCheckUtils]: 11: Hoare triple {3813#(<= main_~k~0 5)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3427#(not (= |assume_abort_if_not_#in~cond| 0))} {3397#true} #53#return; {3813#(<= main_~k~0 5)} is VALID [2022-04-08 14:31:24,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {3427#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:31:24,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {3841#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:31:24,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {3397#true} ~cond := #in~cond; {3841#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 14:31:24,761 INFO L272 TraceCheckUtils]: 6: Hoare triple {3397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:31:24,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {3397#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3397#true} is VALID [2022-04-08 14:31:24,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret5 := main(); {3397#true} is VALID [2022-04-08 14:31:24,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #63#return; {3397#true} is VALID [2022-04-08 14:31:24,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:31:24,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {3397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3397#true} is VALID [2022-04-08 14:31:24,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2022-04-08 14:31:24,762 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-08 14:31:24,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:24,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347437103] [2022-04-08 14:31:24,762 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:24,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784949981] [2022-04-08 14:31:24,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784949981] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:31:24,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:31:24,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-08 14:31:24,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:24,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [196736688] [2022-04-08 14:31:24,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [196736688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:24,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:24,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:31:24,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900866586] [2022-04-08 14:31:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:24,769 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-08 14:31:24,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:24,770 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-08 14:31:24,816 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-08 14:31:24,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:31:24,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:24,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:31:24,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:31:24,818 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-08 14:31:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:25,087 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-08 14:31:25,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:31:25,087 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-08 14:31:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:25,088 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-08 14:31:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 14:31:25,090 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-08 14:31:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 14:31:25,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-08 14:31:25,141 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-08 14:31:25,141 INFO L225 Difference]: With dead ends: 54 [2022-04-08 14:31:25,141 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:31:25,142 INFO L912 BasicCegarLoop]: 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-08 14:31:25,142 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:31:25,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:31:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:31:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:31:25,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:25,143 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-08 14:31:25,144 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-08 14:31:25,144 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-08 14:31:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:25,144 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:31:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:31:25,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:25,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:25,144 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-08 14:31:25,144 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-08 14:31:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:25,144 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:31:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:31:25,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:25,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:25,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:25,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:25,145 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-08 14:31:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:31:25,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-04-08 14:31:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:25,145 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:31:25,145 INFO L479 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-08 14:31:25,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:31:25,145 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-08 14:31:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:31:25,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:25,148 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:31:25,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 14:31:25,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 14:31:25,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:31:26,233 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 14:31:26,233 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 14:31:26,233 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 14:31:26,233 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-08 14:31:26,233 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-08 14:31:26,233 INFO L878 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-08 14:31:26,233 INFO L878 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-08 14:31:26,233 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 17 42) the Hoare annotation is: true [2022-04-08 14:31:26,234 INFO L878 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10))))) (or (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)))) [2022-04-08 14:31:26,234 INFO L878 garLoopResultBuilder]: At program point L29-1(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10))))) (or (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)))) [2022-04-08 14:31:26,234 INFO L878 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10))))) (or (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)))) [2022-04-08 14:31:26,234 INFO L878 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse1 (+ (- 1) main_~y~0)) (.cse0 (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~c~0 3) (= main_~y~0 3) .cse0 (<= main_~k~0 3) (< 2 main_~k~0)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (= .cse1 0) (<= main_~k~0 1) .cse0 (< 0 main_~k~0) (<= main_~c~0 1)) (and (= 3 .cse1) (< 3 main_~k~0) .cse0 (<= main_~k~0 4) (<= main_~c~0 4)) (and (<= main_~c~0 5) (<= main_~k~0 5) .cse0 (= 5 main_~y~0) (< 4 main_~k~0)))) [2022-04-08 14:31:26,234 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 42) the Hoare annotation is: true [2022-04-08 14:31:26,234 INFO L878 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (<= main_~k~0 5) (<= 0 main_~k~0)) [2022-04-08 14:31:26,234 INFO L885 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-08 14:31:26,234 INFO L878 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= main_~k~0 5) (<= 0 main_~k~0)) [2022-04-08 14:31:26,234 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 42) the Hoare annotation is: true [2022-04-08 14:31:26,234 INFO L885 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: true [2022-04-08 14:31:26,234 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse1 (+ (- 1) main_~y~0)) (.cse0 (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~c~0 3) (= main_~y~0 3) .cse0 (<= main_~k~0 3) (< 2 main_~k~0)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (= .cse1 0) (<= main_~k~0 1) .cse0 (< 0 main_~k~0) (<= main_~c~0 1)) (and (= 3 .cse1) (< 3 main_~k~0) .cse0 (<= main_~k~0 4) (<= main_~c~0 4)) (and (<= main_~c~0 5) (<= main_~k~0 5) .cse0 (= 5 main_~y~0) (< 4 main_~k~0)))) [2022-04-08 14:31:26,234 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:31:26,234 INFO L878 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-08 14:31:26,234 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:31:26,235 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:31:26,235 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 14:31:26,235 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 14:31:26,235 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:31:26,235 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-08 14:31:26,235 INFO L878 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 14:31:26,235 INFO L878 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-08 14:31:26,235 INFO L878 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-08 14:31:26,235 INFO L878 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-08 14:31:26,235 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 14:31:26,238 INFO L719 BasicCegarLoop]: Path program histogram: [12, 2, 2, 2] [2022-04-08 14:31:26,238 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:31:26,241 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:31:26,242 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:31:26,715 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-08 14:31:26,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:31:26 BoogieIcfgContainer [2022-04-08 14:31:26,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:31:26,727 INFO L158 Benchmark]: Toolchain (without parser) took 24493.69ms. Allocated memory was 201.3MB in the beginning and 348.1MB in the end (delta: 146.8MB). Free memory was 144.9MB in the beginning and 235.2MB in the end (delta: -90.3MB). Peak memory consumption was 58.0MB. Max. memory is 8.0GB. [2022-04-08 14:31:26,727 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:31:26,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.99ms. Allocated memory was 201.3MB in the beginning and 289.4MB in the end (delta: 88.1MB). Free memory was 144.7MB in the beginning and 259.7MB in the end (delta: -115.0MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2022-04-08 14:31:26,728 INFO L158 Benchmark]: Boogie Preprocessor took 34.20ms. Allocated memory is still 289.4MB. Free memory was 259.7MB in the beginning and 258.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 14:31:26,728 INFO L158 Benchmark]: RCFGBuilder took 315.73ms. Allocated memory is still 289.4MB. Free memory was 258.1MB in the beginning and 247.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 14:31:26,728 INFO L158 Benchmark]: TraceAbstraction took 23933.55ms. Allocated memory was 289.4MB in the beginning and 348.1MB in the end (delta: 58.7MB). Free memory was 246.5MB in the beginning and 235.2MB in the end (delta: 11.3MB). Peak memory consumption was 70.9MB. Max. memory is 8.0GB. [2022-04-08 14:31:26,730 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.99ms. Allocated memory was 201.3MB in the beginning and 289.4MB in the end (delta: 88.1MB). Free memory was 144.7MB in the beginning and 259.7MB in the end (delta: -115.0MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.20ms. Allocated memory is still 289.4MB. Free memory was 259.7MB in the beginning and 258.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 315.73ms. Allocated memory is still 289.4MB. Free memory was 258.1MB in the beginning and 247.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 23933.55ms. Allocated memory was 289.4MB in the beginning and 348.1MB in the end (delta: 58.7MB). Free memory was 246.5MB in the beginning and 235.2MB in the end (delta: 11.3MB). Peak memory consumption was 70.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 1321 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1036 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 757 IncrementalHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 285 mSDtfsCounter, 757 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 612 GetRequests, 515 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=8, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 175 PreInvPairs, 256 NumberOfFragments, 1269 HoareAnnotationTreeSize, 175 FomulaSimplifications, 243 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 58 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((((c <= 5 && k <= 5) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && 5 == y) && 5 <= c) && 4 < k) || ((((k <= 5 && 0 <= k) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && c == 0) && y == 0)) || ((((y == 2 && k <= 5) && 1 < k) && c == 2) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10)) || ((((k <= 5 && y == 1) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && 0 < k) && c == 1)) || ((((k <= 5 && y == 4) && c == 4) && 3 < k) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10)) || ((((k <= 5 && y == 3) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && 2 < k) && c == 3) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-08 14:31:26,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...