/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/loop-invgen/MADWiFi-encode_ie_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:27:41,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:27:41,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:27:41,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:27:41,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:27:41,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:27:41,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:27:41,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:27:41,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:27:41,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:27:41,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:27:41,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:27:41,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:27:41,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:27:41,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:27:41,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:27:41,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:27:41,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:27:41,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:27:41,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:27:41,626 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:27:41,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:27:41,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:27:41,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:27:41,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:27:41,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:27:41,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:27:41,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:27:41,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:27:41,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:27:41,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:27:41,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:27:41,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:27:41,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:27:41,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:27:41,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:27:41,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:27:41,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:27:41,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:27:41,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:27:41,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:27:41,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:27:41,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:27:41,641 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:27:41,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:27:41,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:27:41,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:27:41,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:27:41,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:27:41,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:27:41,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:27:41,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:27:41,643 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:27:41,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:27:41,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:27:41,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:27:41,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:27:41,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:27:41,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:27:41,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:27:41,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:27:41,644 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:27:41,644 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:27:41,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:27:41,644 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:27:41,644 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:27:41,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:27:41,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:27:41,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:27:41,833 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:27:41,847 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:27:41,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2022-04-28 09:27:41,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f53a0db26/161c7d4471124806b0b8d019e443d17b/FLAGafd2248ce [2022-04-28 09:27:42,270 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:27:42,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2022-04-28 09:27:42,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f53a0db26/161c7d4471124806b0b8d019e443d17b/FLAGafd2248ce [2022-04-28 09:27:42,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f53a0db26/161c7d4471124806b0b8d019e443d17b [2022-04-28 09:27:42,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:27:42,290 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:27:42,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:27:42,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:27:42,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:27:42,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:27:42" (1/1) ... [2022-04-28 09:27:42,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557ef040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:42, skipping insertion in model container [2022-04-28 09:27:42,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:27:42" (1/1) ... [2022-04-28 09:27:42,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:27:42,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:27:42,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i[893,906] [2022-04-28 09:27:42,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:27:42,499 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:27:42,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i[893,906] [2022-04-28 09:27:42,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:27:42,535 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:27:42,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:42 WrapperNode [2022-04-28 09:27:42,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:27:42,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:27:42,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:27:42,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:27:42,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:42" (1/1) ... [2022-04-28 09:27:42,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:42" (1/1) ... [2022-04-28 09:27:42,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:42" (1/1) ... [2022-04-28 09:27:42,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:42" (1/1) ... [2022-04-28 09:27:42,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:42" (1/1) ... [2022-04-28 09:27:42,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:42" (1/1) ... [2022-04-28 09:27:42,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:42" (1/1) ... [2022-04-28 09:27:42,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:27:42,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:27:42,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:27:42,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:27:42,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:42" (1/1) ... [2022-04-28 09:27:42,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:27:42,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:27:42,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:27:42,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:27:42,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:27:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:27:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:27:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:27:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:27:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:27:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:27:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:27:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:27:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:27:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:27:42,701 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:27:42,702 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:27:42,883 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:27:42,888 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:27:42,888 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:27:42,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:27:42 BoogieIcfgContainer [2022-04-28 09:27:42,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:27:42,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:27:42,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:27:42,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:27:42,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:27:42" (1/3) ... [2022-04-28 09:27:42,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d247933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:27:42, skipping insertion in model container [2022-04-28 09:27:42,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:42" (2/3) ... [2022-04-28 09:27:42,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d247933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:27:42, skipping insertion in model container [2022-04-28 09:27:42,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:27:42" (3/3) ... [2022-04-28 09:27:42,895 INFO L111 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2022-04-28 09:27:42,904 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:27:42,905 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:27:42,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:27:42,966 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e88cfa9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@719c6b8c [2022-04-28 09:27:42,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:27:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:27:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 09:27:42,988 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:27:42,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:27:42,989 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:27:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:27:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1180455853, now seen corresponding path program 1 times [2022-04-28 09:27:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:43,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032419314] [2022-04-28 09:27:43,013 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:27:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1180455853, now seen corresponding path program 2 times [2022-04-28 09:27:43,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:27:43,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603456425] [2022-04-28 09:27:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:27:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:27:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:27:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:43,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(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); {32#true} is VALID [2022-04-28 09:27:43,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 09:27:43,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-28 09:27:43,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:27:43,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(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); {32#true} is VALID [2022-04-28 09:27:43,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 09:27:43,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-28 09:27:43,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-28 09:27:43,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~leader_len~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufsize~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~ielen~0 := #t~nondet3;havoc #t~nondet3; {32#true} is VALID [2022-04-28 09:27:43,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} assume !!(~leader_len~0 < 1000000); {32#true} is VALID [2022-04-28 09:27:43,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} assume !!(~bufsize~0 < 1000000); {32#true} is VALID [2022-04-28 09:27:43,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume !!(~ielen~0 < 1000000); {32#true} is VALID [2022-04-28 09:27:43,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} assume ~leader_len~0 > 0; {37#(<= 1 main_~leader_len~0)} is VALID [2022-04-28 09:27:43,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= 1 main_~leader_len~0)} assume ~bufsize~0 > 0; {37#(<= 1 main_~leader_len~0)} is VALID [2022-04-28 09:27:43,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= 1 main_~leader_len~0)} assume ~ielen~0 > 0; {37#(<= 1 main_~leader_len~0)} is VALID [2022-04-28 09:27:43,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= 1 main_~leader_len~0)} assume !(~bufsize~0 < ~leader_len~0);~p~0 := 0;~bufsize_0~0 := ~bufsize~0;~bufsize~0 := ~bufsize~0 - ~leader_len~0;~p~0 := ~p~0 + ~leader_len~0; {38#(<= 1 main_~p~0)} is VALID [2022-04-28 09:27:43,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(<= 1 main_~p~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {38#(<= 1 main_~p~0)} is VALID [2022-04-28 09:27:43,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#(<= 1 main_~p~0)} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {38#(<= 1 main_~p~0)} is VALID [2022-04-28 09:27:43,280 INFO L272 TraceCheckUtils]: 15: Hoare triple {38#(<= 1 main_~p~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:27:43,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:27:43,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-28 09:27:43,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 09:27:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:27:43,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:27:43,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603456425] [2022-04-28 09:27:43,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603456425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:43,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:43,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:27:43,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:27:43,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032419314] [2022-04-28 09:27:43,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032419314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:43,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:43,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:27:43,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039919574] [2022-04-28 09:27:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:27:43,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 09:27:43,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:27:43,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:27:43,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:43,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:27:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:43,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:27:43,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:27:43,328 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:27:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:43,726 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-28 09:27:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:27:43,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 09:27:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:27:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:27:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 09:27:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:27:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 09:27:43,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2022-04-28 09:27:43,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:43,797 INFO L225 Difference]: With dead ends: 52 [2022-04-28 09:27:43,797 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 09:27:43,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:27:43,801 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:27:43,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 60 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:27:43,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 09:27:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 09:27:43,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:27:43,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:27:43,832 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:27:43,832 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:27:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:43,834 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 09:27:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 09:27:43,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:43,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:43,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 09:27:43,835 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 09:27:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:43,837 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 09:27:43,837 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 09:27:43,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:43,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:43,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:27:43,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:27:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:27:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 09:27:43,839 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2022-04-28 09:27:43,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:27:43,839 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 09:27:43,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:27:43,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 09:27:43,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 09:27:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 09:27:43,872 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:27:43,872 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:27:43,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:27:43,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:27:43,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:27:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash -107986180, now seen corresponding path program 1 times [2022-04-28 09:27:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:43,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573521813] [2022-04-28 09:27:43,874 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:27:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash -107986180, now seen corresponding path program 2 times [2022-04-28 09:27:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:27:43,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578405340] [2022-04-28 09:27:43,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:27:43,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:27:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:27:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:43,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#(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); {274#true} is VALID [2022-04-28 09:27:43,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-28 09:27:43,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} #94#return; {274#true} is VALID [2022-04-28 09:27:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-28 09:27:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:43,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-28 09:27:43,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-28 09:27:43,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-28 09:27:43,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} #90#return; {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:43,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:27:43,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#(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); {274#true} is VALID [2022-04-28 09:27:43,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-28 09:27:43,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #94#return; {274#true} is VALID [2022-04-28 09:27:43,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret5 := main(); {274#true} is VALID [2022-04-28 09:27:43,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~leader_len~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufsize~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~ielen~0 := #t~nondet3;havoc #t~nondet3; {274#true} is VALID [2022-04-28 09:27:43,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#true} assume !!(~leader_len~0 < 1000000); {274#true} is VALID [2022-04-28 09:27:43,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} assume !!(~bufsize~0 < 1000000); {274#true} is VALID [2022-04-28 09:27:43,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#true} assume !!(~ielen~0 < 1000000); {274#true} is VALID [2022-04-28 09:27:43,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#true} assume ~leader_len~0 > 0; {274#true} is VALID [2022-04-28 09:27:43,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {274#true} assume ~bufsize~0 > 0; {274#true} is VALID [2022-04-28 09:27:43,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#true} assume ~ielen~0 > 0; {274#true} is VALID [2022-04-28 09:27:43,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#true} assume !(~bufsize~0 < ~leader_len~0);~p~0 := 0;~bufsize_0~0 := ~bufsize~0;~bufsize~0 := ~bufsize~0 - ~leader_len~0;~p~0 := ~p~0 + ~leader_len~0; {279#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:43,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {279#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:43,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {279#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:43,963 INFO L272 TraceCheckUtils]: 15: Hoare triple {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {274#true} is VALID [2022-04-28 09:27:43,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-28 09:27:43,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-28 09:27:43,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-28 09:27:43,964 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {274#true} {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} #90#return; {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:43,964 INFO L272 TraceCheckUtils]: 20: Hoare triple {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {285#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:27:43,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {285#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {286#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:27:43,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {286#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {275#false} is VALID [2022-04-28 09:27:43,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-28 09:27:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:27:43,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:27:43,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578405340] [2022-04-28 09:27:43,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578405340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:43,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:43,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:27:43,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:27:43,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573521813] [2022-04-28 09:27:43,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573521813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:43,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:43,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:27:43,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906447110] [2022-04-28 09:27:43,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:27:43,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-28 09:27:43,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:27:43,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:27:43,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:43,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:27:43,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:43,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:27:43,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:27:43,982 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:27:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:44,233 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-28 09:27:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:27:44,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-28 09:27:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:27:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:27:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-28 09:27:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:27:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-28 09:27:44,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-28 09:27:44,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:44,267 INFO L225 Difference]: With dead ends: 39 [2022-04-28 09:27:44,267 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 09:27:44,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:27:44,268 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:27:44,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:27:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 09:27:44,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-28 09:27:44,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:27:44,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:27:44,299 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:27:44,299 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:27:44,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:44,304 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-28 09:27:44,304 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 09:27:44,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:44,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:44,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-28 09:27:44,305 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-28 09:27:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:44,312 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-28 09:27:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 09:27:44,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:44,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:44,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:27:44,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:27:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:27:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-04-28 09:27:44,318 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2022-04-28 09:27:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:27:44,319 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-04-28 09:27:44,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:27:44,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2022-04-28 09:27:44,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-04-28 09:27:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 09:27:44,350 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:27:44,350 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:27:44,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:27:44,357 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:27:44,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:27:44,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1340590469, now seen corresponding path program 1 times [2022-04-28 09:27:44,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:44,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603733113] [2022-04-28 09:27:44,478 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:27:44,478 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:27:44,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1340590469, now seen corresponding path program 2 times [2022-04-28 09:27:44,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:27:44,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492924635] [2022-04-28 09:27:44,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:27:44,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:27:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:27:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:44,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {548#(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); {524#true} is VALID [2022-04-28 09:27:44,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:44,630 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {524#true} {524#true} #94#return; {524#true} is VALID [2022-04-28 09:27:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-28 09:27:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:44,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:44,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:44,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:44,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {524#true} {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #90#return; {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:44,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-28 09:27:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:44,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:44,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:44,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:44,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {524#true} {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #92#return; {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:44,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 09:27:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:44,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:44,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:44,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:44,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {524#true} {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #90#return; {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:44,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {524#true} call ULTIMATE.init(); {548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:27:44,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {548#(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); {524#true} is VALID [2022-04-28 09:27:44,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:44,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {524#true} {524#true} #94#return; {524#true} is VALID [2022-04-28 09:27:44,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {524#true} call #t~ret5 := main(); {524#true} is VALID [2022-04-28 09:27:44,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~leader_len~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufsize~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~ielen~0 := #t~nondet3;havoc #t~nondet3; {524#true} is VALID [2022-04-28 09:27:44,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {524#true} assume !!(~leader_len~0 < 1000000); {524#true} is VALID [2022-04-28 09:27:44,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {524#true} assume !!(~bufsize~0 < 1000000); {524#true} is VALID [2022-04-28 09:27:44,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#true} assume !!(~ielen~0 < 1000000); {524#true} is VALID [2022-04-28 09:27:44,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#true} assume ~leader_len~0 > 0; {524#true} is VALID [2022-04-28 09:27:44,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#true} assume ~bufsize~0 > 0; {524#true} is VALID [2022-04-28 09:27:44,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#true} assume ~ielen~0 > 0; {524#true} is VALID [2022-04-28 09:27:44,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#true} assume !(~bufsize~0 < ~leader_len~0);~p~0 := 0;~bufsize_0~0 := ~bufsize~0;~bufsize~0 := ~bufsize~0 - ~leader_len~0;~p~0 := ~p~0 + ~leader_len~0; {529#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:44,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {529#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:44,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:44,651 INFO L272 TraceCheckUtils]: 15: Hoare triple {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {524#true} is VALID [2022-04-28 09:27:44,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:44,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:44,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:44,652 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {524#true} {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #90#return; {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:44,652 INFO L272 TraceCheckUtils]: 20: Hoare triple {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {524#true} is VALID [2022-04-28 09:27:44,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:44,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:44,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:44,653 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {524#true} {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #92#return; {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:44,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {530#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} ~p~0 := 2 + ~p~0; {539#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (= main_~i~0 0))} is VALID [2022-04-28 09:27:44,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {539#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {540#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-28 09:27:44,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {540#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:44,654 INFO L272 TraceCheckUtils]: 28: Hoare triple {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {524#true} is VALID [2022-04-28 09:27:44,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:44,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:44,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:44,655 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {524#true} {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #90#return; {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:44,655 INFO L272 TraceCheckUtils]: 33: Hoare triple {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {546#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:27:44,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {546#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {547#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:27:44,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {547#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {525#false} is VALID [2022-04-28 09:27:44,656 INFO L290 TraceCheckUtils]: 36: Hoare triple {525#false} assume !false; {525#false} is VALID [2022-04-28 09:27:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:27:44,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:27:44,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492924635] [2022-04-28 09:27:44,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492924635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:27:44,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7732054] [2022-04-28 09:27:44,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:27:44,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:27:44,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:27:44,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:27:44,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:27:44,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:27:44,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:27:44,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 09:27:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:44,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:27:45,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {524#true} call ULTIMATE.init(); {524#true} is VALID [2022-04-28 09:27:45,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#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); {524#true} is VALID [2022-04-28 09:27:45,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:45,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {524#true} {524#true} #94#return; {524#true} is VALID [2022-04-28 09:27:45,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {524#true} call #t~ret5 := main(); {524#true} is VALID [2022-04-28 09:27:45,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~leader_len~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufsize~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~ielen~0 := #t~nondet3;havoc #t~nondet3; {524#true} is VALID [2022-04-28 09:27:45,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {524#true} assume !!(~leader_len~0 < 1000000); {524#true} is VALID [2022-04-28 09:27:45,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {524#true} assume !!(~bufsize~0 < 1000000); {524#true} is VALID [2022-04-28 09:27:45,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#true} assume !!(~ielen~0 < 1000000); {524#true} is VALID [2022-04-28 09:27:45,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#true} assume ~leader_len~0 > 0; {524#true} is VALID [2022-04-28 09:27:45,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#true} assume ~bufsize~0 > 0; {524#true} is VALID [2022-04-28 09:27:45,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#true} assume ~ielen~0 > 0; {524#true} is VALID [2022-04-28 09:27:45,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#true} assume !(~bufsize~0 < ~leader_len~0);~p~0 := 0;~bufsize_0~0 := ~bufsize~0;~bufsize~0 := ~bufsize~0 - ~leader_len~0;~p~0 := ~p~0 + ~leader_len~0; {529#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:45,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {529#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {591#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:45,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {591#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {591#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:45,033 INFO L272 TraceCheckUtils]: 15: Hoare triple {591#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {524#true} is VALID [2022-04-28 09:27:45,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:45,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:45,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:45,034 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {524#true} {591#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #90#return; {591#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:45,034 INFO L272 TraceCheckUtils]: 20: Hoare triple {591#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {524#true} is VALID [2022-04-28 09:27:45,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:45,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:45,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:45,035 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {524#true} {591#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #92#return; {591#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:45,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {591#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} ~p~0 := 2 + ~p~0; {628#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 0 main_~i~0))} is VALID [2022-04-28 09:27:45,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {628#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 0 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {632#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} is VALID [2022-04-28 09:27:45,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {632#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:45,036 INFO L272 TraceCheckUtils]: 28: Hoare triple {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {524#true} is VALID [2022-04-28 09:27:45,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:45,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:45,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:45,037 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {524#true} {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #90#return; {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:45,038 INFO L272 TraceCheckUtils]: 33: Hoare triple {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {654#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:27:45,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {654#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {658#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:27:45,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {658#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {525#false} is VALID [2022-04-28 09:27:45,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {525#false} assume !false; {525#false} is VALID [2022-04-28 09:27:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:27:45,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:27:45,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {525#false} assume !false; {525#false} is VALID [2022-04-28 09:27:45,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {658#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {525#false} is VALID [2022-04-28 09:27:45,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {654#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {658#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:27:45,472 INFO L272 TraceCheckUtils]: 33: Hoare triple {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {654#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:27:45,472 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {524#true} {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #90#return; {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:45,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:45,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:45,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:45,473 INFO L272 TraceCheckUtils]: 28: Hoare triple {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {524#true} is VALID [2022-04-28 09:27:45,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {692#(or (not (< main_~i~0 main_~ielen~0)) (<= (+ main_~p~0 2) main_~bufsize_0~0))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {541#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:45,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {696#(or (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {692#(or (not (< main_~i~0 main_~ielen~0)) (<= (+ main_~p~0 2) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:45,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {700#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} ~p~0 := 2 + ~p~0; {696#(or (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:27:45,475 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {524#true} {700#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} #92#return; {700#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:27:45,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:45,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:45,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:45,475 INFO L272 TraceCheckUtils]: 20: Hoare triple {700#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {524#true} is VALID [2022-04-28 09:27:45,476 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {524#true} {700#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} #90#return; {700#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:27:45,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:45,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 09:27:45,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 09:27:45,476 INFO L272 TraceCheckUtils]: 15: Hoare triple {700#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {524#true} is VALID [2022-04-28 09:27:45,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {700#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {700#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:27:45,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {737#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= (div (+ (- 1) (* (- 1) main_~bufsize~0)) (- 2)) 2))} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {700#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:27:45,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#true} assume !(~bufsize~0 < ~leader_len~0);~p~0 := 0;~bufsize_0~0 := ~bufsize~0;~bufsize~0 := ~bufsize~0 - ~leader_len~0;~p~0 := ~p~0 + ~leader_len~0; {737#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= (div (+ (- 1) (* (- 1) main_~bufsize~0)) (- 2)) 2))} is VALID [2022-04-28 09:27:45,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#true} assume ~ielen~0 > 0; {524#true} is VALID [2022-04-28 09:27:45,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#true} assume ~bufsize~0 > 0; {524#true} is VALID [2022-04-28 09:27:45,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#true} assume ~leader_len~0 > 0; {524#true} is VALID [2022-04-28 09:27:45,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#true} assume !!(~ielen~0 < 1000000); {524#true} is VALID [2022-04-28 09:27:45,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {524#true} assume !!(~bufsize~0 < 1000000); {524#true} is VALID [2022-04-28 09:27:45,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {524#true} assume !!(~leader_len~0 < 1000000); {524#true} is VALID [2022-04-28 09:27:45,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~leader_len~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufsize~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~ielen~0 := #t~nondet3;havoc #t~nondet3; {524#true} is VALID [2022-04-28 09:27:45,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {524#true} call #t~ret5 := main(); {524#true} is VALID [2022-04-28 09:27:45,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {524#true} {524#true} #94#return; {524#true} is VALID [2022-04-28 09:27:45,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 09:27:45,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#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); {524#true} is VALID [2022-04-28 09:27:45,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {524#true} call ULTIMATE.init(); {524#true} is VALID [2022-04-28 09:27:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:27:45,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7732054] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:27:45,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:27:45,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-28 09:27:45,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:27:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603733113] [2022-04-28 09:27:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603733113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:45,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:45,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:27:45,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519103571] [2022-04-28 09:27:45,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:27:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-28 09:27:45,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:27:45,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:45,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:45,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:27:45,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:45,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:27:45,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:27:45,514 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:45,954 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-04-28 09:27:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:27:45,955 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-28 09:27:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:27:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 09:27:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 09:27:45,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-04-28 09:27:45,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:45,991 INFO L225 Difference]: With dead ends: 48 [2022-04-28 09:27:45,991 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 09:27:45,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2022-04-28 09:27:45,992 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:27:45,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 53 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:27:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 09:27:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-28 09:27:46,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:27:46,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:27:46,020 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:27:46,021 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:27:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:46,022 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-04-28 09:27:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-28 09:27:46,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:46,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:46,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 09:27:46,023 INFO L87 Difference]: Start difference. First operand has 45 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 09:27:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:46,025 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-04-28 09:27:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-28 09:27:46,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:46,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:46,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:27:46,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:27:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:27:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-28 09:27:46,027 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2022-04-28 09:27:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:27:46,027 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-28 09:27:46,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:46,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-28 09:27:46,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-28 09:27:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 09:27:46,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:27:46,081 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:27:46,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:27:46,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:27:46,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:27:46,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:27:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1604703908, now seen corresponding path program 3 times [2022-04-28 09:27:46,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:46,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1886950230] [2022-04-28 09:27:46,377 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:27:46,378 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:27:46,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1604703908, now seen corresponding path program 4 times [2022-04-28 09:27:46,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:27:46,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146252093] [2022-04-28 09:27:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:27:46,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:27:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:27:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:46,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {1109#(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); {1076#true} is VALID [2022-04-28 09:27:46,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1076#true} {1076#true} #94#return; {1076#true} is VALID [2022-04-28 09:27:46,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-28 09:27:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:46,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:46,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:46,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #90#return; {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:46,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-28 09:27:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:46,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:46,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:46,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #92#return; {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:46,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 09:27:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:46,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:46,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:46,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} #90#return; {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-28 09:27:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:27:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:46,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:46,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:46,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} #92#return; {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-28 09:27:46,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 09:27:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:46,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:46,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:46,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #90#return; {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:46,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {1076#true} call ULTIMATE.init(); {1109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:27:46,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {1109#(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); {1076#true} is VALID [2022-04-28 09:27:46,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1076#true} #94#return; {1076#true} is VALID [2022-04-28 09:27:46,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {1076#true} call #t~ret5 := main(); {1076#true} is VALID [2022-04-28 09:27:46,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {1076#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~leader_len~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufsize~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~ielen~0 := #t~nondet3;havoc #t~nondet3; {1076#true} is VALID [2022-04-28 09:27:46,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {1076#true} assume !!(~leader_len~0 < 1000000); {1076#true} is VALID [2022-04-28 09:27:46,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#true} assume !!(~bufsize~0 < 1000000); {1076#true} is VALID [2022-04-28 09:27:46,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#true} assume !!(~ielen~0 < 1000000); {1076#true} is VALID [2022-04-28 09:27:46,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#true} assume ~leader_len~0 > 0; {1076#true} is VALID [2022-04-28 09:27:46,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {1076#true} assume ~bufsize~0 > 0; {1076#true} is VALID [2022-04-28 09:27:46,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {1076#true} assume ~ielen~0 > 0; {1076#true} is VALID [2022-04-28 09:27:46,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {1076#true} assume !(~bufsize~0 < ~leader_len~0);~p~0 := 0;~bufsize_0~0 := ~bufsize~0;~bufsize~0 := ~bufsize~0 - ~leader_len~0;~p~0 := ~p~0 + ~leader_len~0; {1081#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:46,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {1081#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:46,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:46,594 INFO L272 TraceCheckUtils]: 15: Hoare triple {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:46,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:46,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:46,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,595 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1076#true} {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #90#return; {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:46,595 INFO L272 TraceCheckUtils]: 20: Hoare triple {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:46,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:46,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:46,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,596 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1076#true} {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #92#return; {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:46,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {1082#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} ~p~0 := 2 + ~p~0; {1091#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (= main_~i~0 0))} is VALID [2022-04-28 09:27:46,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {1091#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-28 09:27:46,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-28 09:27:46,597 INFO L272 TraceCheckUtils]: 28: Hoare triple {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:46,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:46,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:46,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,598 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1076#true} {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} #90#return; {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-28 09:27:46,598 INFO L272 TraceCheckUtils]: 33: Hoare triple {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:46,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:46,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:46,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,599 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1076#true} {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} #92#return; {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-28 09:27:46,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} ~p~0 := 2 + ~p~0; {1101#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2 (* main_~i~0 2)))} is VALID [2022-04-28 09:27:46,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {1101#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2 (* main_~i~0 2)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-28 09:27:46,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {1092#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:46,600 INFO L272 TraceCheckUtils]: 41: Hoare triple {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:46,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:46,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:46,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:46,601 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1076#true} {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #90#return; {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:46,602 INFO L272 TraceCheckUtils]: 46: Hoare triple {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {1107#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:27:46,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {1107#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1108#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:27:46,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {1108#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1077#false} is VALID [2022-04-28 09:27:46,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {1077#false} assume !false; {1077#false} is VALID [2022-04-28 09:27:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 09:27:46,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:27:46,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146252093] [2022-04-28 09:27:46,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146252093] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:27:46,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619821277] [2022-04-28 09:27:46,603 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:27:46,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:27:46,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:27:46,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:27:46,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:27:46,650 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:27:46,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:27:46,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 09:27:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:46,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:27:47,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {1076#true} call ULTIMATE.init(); {1076#true} is VALID [2022-04-28 09:27:47,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#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); {1076#true} is VALID [2022-04-28 09:27:47,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1076#true} #94#return; {1076#true} is VALID [2022-04-28 09:27:47,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {1076#true} call #t~ret5 := main(); {1076#true} is VALID [2022-04-28 09:27:47,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {1076#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~leader_len~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufsize~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~ielen~0 := #t~nondet3;havoc #t~nondet3; {1076#true} is VALID [2022-04-28 09:27:47,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {1076#true} assume !!(~leader_len~0 < 1000000); {1076#true} is VALID [2022-04-28 09:27:47,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#true} assume !!(~bufsize~0 < 1000000); {1076#true} is VALID [2022-04-28 09:27:47,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#true} assume !!(~ielen~0 < 1000000); {1076#true} is VALID [2022-04-28 09:27:47,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#true} assume ~leader_len~0 > 0; {1076#true} is VALID [2022-04-28 09:27:47,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {1076#true} assume ~bufsize~0 > 0; {1076#true} is VALID [2022-04-28 09:27:47,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {1076#true} assume ~ielen~0 > 0; {1076#true} is VALID [2022-04-28 09:27:47,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {1076#true} assume !(~bufsize~0 < ~leader_len~0);~p~0 := 0;~bufsize_0~0 := ~bufsize~0;~bufsize~0 := ~bufsize~0 - ~leader_len~0;~p~0 := ~p~0 + ~leader_len~0; {1081#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:47,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {1081#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {1152#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:47,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {1152#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {1152#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:47,016 INFO L272 TraceCheckUtils]: 15: Hoare triple {1152#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:47,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:47,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:47,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,018 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1076#true} {1152#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #90#return; {1152#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:47,018 INFO L272 TraceCheckUtils]: 20: Hoare triple {1152#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:47,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:47,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:47,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,018 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1076#true} {1152#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} #92#return; {1152#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:47,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {1152#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} ~p~0 := 2 + ~p~0; {1189#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 0 main_~i~0))} is VALID [2022-04-28 09:27:47,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {1189#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 0 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1193#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} is VALID [2022-04-28 09:27:47,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {1193#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {1193#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} is VALID [2022-04-28 09:27:47,020 INFO L272 TraceCheckUtils]: 28: Hoare triple {1193#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:47,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:47,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:47,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,020 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1076#true} {1193#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} #90#return; {1193#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} is VALID [2022-04-28 09:27:47,021 INFO L272 TraceCheckUtils]: 33: Hoare triple {1193#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:47,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:47,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:47,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,021 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1076#true} {1193#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} #92#return; {1193#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} is VALID [2022-04-28 09:27:47,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {1193#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} ~p~0 := 2 + ~p~0; {1230#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)) (<= 1 main_~i~0))} is VALID [2022-04-28 09:27:47,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {1230#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)) (<= 1 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1234#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} is VALID [2022-04-28 09:27:47,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {1234#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:47,023 INFO L272 TraceCheckUtils]: 41: Hoare triple {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:47,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:47,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:47,023 INFO L290 TraceCheckUtils]: 44: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,023 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1076#true} {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #90#return; {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:47,025 INFO L272 TraceCheckUtils]: 46: Hoare triple {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {1256#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:27:47,025 INFO L290 TraceCheckUtils]: 47: Hoare triple {1256#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1260#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:27:47,026 INFO L290 TraceCheckUtils]: 48: Hoare triple {1260#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1077#false} is VALID [2022-04-28 09:27:47,026 INFO L290 TraceCheckUtils]: 49: Hoare triple {1077#false} assume !false; {1077#false} is VALID [2022-04-28 09:27:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 09:27:47,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:27:47,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {1077#false} assume !false; {1077#false} is VALID [2022-04-28 09:27:47,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {1260#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1077#false} is VALID [2022-04-28 09:27:47,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {1256#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1260#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:27:47,469 INFO L272 TraceCheckUtils]: 46: Hoare triple {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {1256#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:27:47,470 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1076#true} {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #90#return; {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:47,470 INFO L290 TraceCheckUtils]: 44: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:47,470 INFO L290 TraceCheckUtils]: 42: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:47,470 INFO L272 TraceCheckUtils]: 41: Hoare triple {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:47,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {1294#(or (not (< main_~i~0 main_~ielen~0)) (<= (+ main_~p~0 2) main_~bufsize_0~0))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {1102#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 09:27:47,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {1298#(or (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1294#(or (not (< main_~i~0 main_~ielen~0)) (<= (+ main_~p~0 2) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:47,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {1302#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} ~p~0 := 2 + ~p~0; {1298#(or (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:27:47,472 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1076#true} {1302#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} #92#return; {1302#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:27:47,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:47,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:47,473 INFO L272 TraceCheckUtils]: 33: Hoare triple {1302#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:47,473 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1076#true} {1302#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} #90#return; {1302#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:27:47,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:47,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:47,473 INFO L272 TraceCheckUtils]: 28: Hoare triple {1302#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:47,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {1302#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {1302#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:27:47,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {1339#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 2)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1302#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:27:47,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} ~p~0 := 2 + ~p~0; {1339#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 2)))} is VALID [2022-04-28 09:27:47,475 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1076#true} {1343#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} #92#return; {1343#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:47,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:47,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:47,475 INFO L272 TraceCheckUtils]: 20: Hoare triple {1343#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:47,476 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1076#true} {1343#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} #90#return; {1343#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:47,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {1076#true} assume !(0 == ~cond); {1076#true} is VALID [2022-04-28 09:27:47,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {1076#true} ~cond := #in~cond; {1076#true} is VALID [2022-04-28 09:27:47,476 INFO L272 TraceCheckUtils]: 15: Hoare triple {1343#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {1076#true} is VALID [2022-04-28 09:27:47,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {1343#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {1343#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:47,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {1380#(or (<= (div (+ (- 1) (* (- 1) main_~bufsize~0)) (- 2)) 3) (<= (+ main_~p~0 6) main_~bufsize_0~0))} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {1343#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:47,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {1076#true} assume !(~bufsize~0 < ~leader_len~0);~p~0 := 0;~bufsize_0~0 := ~bufsize~0;~bufsize~0 := ~bufsize~0 - ~leader_len~0;~p~0 := ~p~0 + ~leader_len~0; {1380#(or (<= (div (+ (- 1) (* (- 1) main_~bufsize~0)) (- 2)) 3) (<= (+ main_~p~0 6) main_~bufsize_0~0))} is VALID [2022-04-28 09:27:47,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {1076#true} assume ~ielen~0 > 0; {1076#true} is VALID [2022-04-28 09:27:47,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {1076#true} assume ~bufsize~0 > 0; {1076#true} is VALID [2022-04-28 09:27:47,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#true} assume ~leader_len~0 > 0; {1076#true} is VALID [2022-04-28 09:27:47,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#true} assume !!(~ielen~0 < 1000000); {1076#true} is VALID [2022-04-28 09:27:47,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#true} assume !!(~bufsize~0 < 1000000); {1076#true} is VALID [2022-04-28 09:27:47,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {1076#true} assume !!(~leader_len~0 < 1000000); {1076#true} is VALID [2022-04-28 09:27:47,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {1076#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~leader_len~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufsize~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~ielen~0 := #t~nondet3;havoc #t~nondet3; {1076#true} is VALID [2022-04-28 09:27:47,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {1076#true} call #t~ret5 := main(); {1076#true} is VALID [2022-04-28 09:27:47,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1076#true} #94#return; {1076#true} is VALID [2022-04-28 09:27:47,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-28 09:27:47,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#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); {1076#true} is VALID [2022-04-28 09:27:47,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {1076#true} call ULTIMATE.init(); {1076#true} is VALID [2022-04-28 09:27:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 09:27:47,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619821277] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:27:47,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:27:47,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-04-28 09:27:47,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:27:47,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1886950230] [2022-04-28 09:27:47,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1886950230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:47,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:47,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:27:47,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914720207] [2022-04-28 09:27:47,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:27:47,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (8), 3 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 50 [2022-04-28 09:27:47,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:27:47,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 09:27:47,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:47,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:27:47,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:47,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:27:47,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:27:47,507 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 09:27:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:47,937 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-28 09:27:47,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:27:47,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (8), 3 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 50 [2022-04-28 09:27:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:27:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 09:27:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 36 transitions. [2022-04-28 09:27:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 09:27:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 36 transitions. [2022-04-28 09:27:47,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 36 transitions. [2022-04-28 09:27:47,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:47,970 INFO L225 Difference]: With dead ends: 45 [2022-04-28 09:27:47,970 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:27:47,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:27:47,972 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:27:47,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:27:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:27:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:27:47,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:27:47,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:27:47,973 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:27:47,973 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:27:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:47,973 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:27:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:27:47,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:47,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:47,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:27:47,973 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:27:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:47,973 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:27:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:27:47,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:47,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:47,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:27:47,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:27:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:27:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:27:47,974 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2022-04-28 09:27:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:27:47,974 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:27:47,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 09:27:47,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:27:47,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:27:47,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:47,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:27:47,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:27:48,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 09:27:48,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:27:48,377 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:27:48,377 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:27:48,377 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:27:48,377 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:27:48,377 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:27:48,377 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:27:48,377 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:27:48,377 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 56) the Hoare annotation is: true [2022-04-28 09:27:48,377 INFO L895 garLoopResultBuilder]: At program point L40(lines 25 56) the Hoare annotation is: (<= 1 main_~leader_len~0) [2022-04-28 09:27:48,377 INFO L902 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: true [2022-04-28 09:27:48,377 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 53) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2 (* main_~i~0 2))) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2022-04-28 09:27:48,377 INFO L895 garLoopResultBuilder]: At program point L49-3(lines 49 53) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2))) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2022-04-28 09:27:48,378 INFO L902 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: true [2022-04-28 09:27:48,378 INFO L902 garLoopResultBuilder]: At program point L54(lines 24 56) the Hoare annotation is: true [2022-04-28 09:27:48,378 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2))) (<= 1 main_~p~0) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~leader_len~0)) [2022-04-28 09:27:48,378 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2))) (<= 1 main_~p~0) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~leader_len~0)) [2022-04-28 09:27:48,378 INFO L902 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-04-28 09:27:48,378 INFO L895 garLoopResultBuilder]: At program point L38-1(lines 25 56) the Hoare annotation is: (<= 1 main_~leader_len~0) [2022-04-28 09:27:48,378 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2022-04-28 09:27:48,378 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2))) (<= 1 main_~p~0) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~leader_len~0)) [2022-04-28 09:27:48,378 INFO L895 garLoopResultBuilder]: At program point L47(lines 47 48) the Hoare annotation is: (and (<= 1 main_~p~0) (<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0) (<= 1 main_~leader_len~0)) [2022-04-28 09:27:48,378 INFO L895 garLoopResultBuilder]: At program point L39(lines 25 56) the Hoare annotation is: (<= 1 main_~leader_len~0) [2022-04-28 09:27:48,378 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-28 09:27:48,378 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:27:48,378 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:27:48,378 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:27:48,378 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:27:48,378 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:27:48,378 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:27:48,378 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:27:48,379 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:27:48,379 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:27:48,379 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:27:48,379 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:27:48,379 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:27:48,379 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:27:48,381 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2] [2022-04-28 09:27:48,382 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:27:48,385 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:27:48,385 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:27:48,386 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:27:48,386 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:27:48,386 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:27:48,386 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:27:48,387 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:27:48,394 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:27:48,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:27:48 BoogieIcfgContainer [2022-04-28 09:27:48,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:27:48,402 INFO L158 Benchmark]: Toolchain (without parser) took 6111.76ms. Allocated memory was 178.3MB in the beginning and 274.7MB in the end (delta: 96.5MB). Free memory was 126.5MB in the beginning and 198.7MB in the end (delta: -72.2MB). Peak memory consumption was 24.3MB. Max. memory is 8.0GB. [2022-04-28 09:27:48,402 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:27:48,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.95ms. Allocated memory was 178.3MB in the beginning and 228.6MB in the end (delta: 50.3MB). Free memory was 126.3MB in the beginning and 204.7MB in the end (delta: -78.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 09:27:48,402 INFO L158 Benchmark]: Boogie Preprocessor took 44.54ms. Allocated memory is still 228.6MB. Free memory was 204.7MB in the beginning and 202.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:27:48,403 INFO L158 Benchmark]: RCFGBuilder took 307.88ms. Allocated memory is still 228.6MB. Free memory was 202.9MB in the beginning and 189.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 09:27:48,403 INFO L158 Benchmark]: TraceAbstraction took 5510.69ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 189.3MB in the beginning and 198.7MB in the end (delta: -9.3MB). Peak memory consumption was 37.5MB. Max. memory is 8.0GB. [2022-04-28 09:27:48,404 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.14ms. Allocated memory is still 178.3MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.95ms. Allocated memory was 178.3MB in the beginning and 228.6MB in the end (delta: 50.3MB). Free memory was 126.3MB in the beginning and 204.7MB in the end (delta: -78.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.54ms. Allocated memory is still 228.6MB. Free memory was 204.7MB in the beginning and 202.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 307.88ms. Allocated memory is still 228.6MB. Free memory was 202.9MB in the beginning and 189.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5510.69ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 189.3MB in the beginning and 198.7MB in the end (delta: -9.3MB). Peak memory consumption was 37.5MB. 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: 19]: 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, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 213 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 516 IncrementalHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 95 mSDtfsCounter, 516 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 176 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=3, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 71 PreInvPairs, 101 NumberOfFragments, 178 HoareAnnotationTreeSize, 71 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 222 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (p + 2 * ielen <= bufsize_0 + i * 2 && 1 <= p) && 1 <= leader_len - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 09:27:48,427 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...