java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:09:24,545 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:09:24,547 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:09:24,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:09:24,562 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:09:24,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:09:24,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:09:24,568 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:09:24,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:09:24,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:09:24,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:09:24,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:09:24,575 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:09:24,576 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:09:24,579 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:09:24,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:09:24,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:09:24,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:09:24,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:09:24,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:09:24,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:09:24,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:09:24,602 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:09:24,602 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:09:24,602 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:09:24,606 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:09:24,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:09:24,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:09:24,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:09:24,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:09:24,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:09:24,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:09:24,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:09:24,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:09:24,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:09:24,615 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:09:24,615 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:09:24,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:09:24,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:09:24,643 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:09:24,643 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:09:24,644 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:09:24,644 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:09:24,644 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:09:24,644 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:09:24,647 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:09:24,647 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:09:24,647 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:09:24,648 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:09:24,648 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:09:24,648 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:09:24,648 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:09:24,648 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:09:24,649 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:09:24,649 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:09:24,649 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:09:24,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:09:24,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:09:24,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:09:24,651 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:09:24,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:09:24,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:09:24,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:09:24,652 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:09:24,652 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:09:24,652 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:09:24,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:09:24,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:09:24,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:09:24,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:09:24,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:09:24,739 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:09:24,740 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:09:24,741 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok_true-unreach-call_true-termination.i [2018-11-23 13:09:24,797 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea70c893/b8aee5594f764c329351bd04fae29101/FLAGc1c7a7aad [2018-11-23 13:09:25,220 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:09:25,221 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok_true-unreach-call_true-termination.i [2018-11-23 13:09:25,228 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea70c893/b8aee5594f764c329351bd04fae29101/FLAGc1c7a7aad [2018-11-23 13:09:25,598 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea70c893/b8aee5594f764c329351bd04fae29101 [2018-11-23 13:09:25,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:09:25,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:09:25,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:25,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:09:25,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:09:25,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:25" (1/1) ... [2018-11-23 13:09:25,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443e7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25, skipping insertion in model container [2018-11-23 13:09:25,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:25" (1/1) ... [2018-11-23 13:09:25,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:09:25,661 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:09:25,844 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:25,849 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:09:25,876 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:25,898 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:09:25,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25 WrapperNode [2018-11-23 13:09:25,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:25,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:25,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:09:25,901 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:09:25,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2018-11-23 13:09:25,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2018-11-23 13:09:25,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:25,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:09:25,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:09:25,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:09:25,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2018-11-23 13:09:25,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2018-11-23 13:09:25,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2018-11-23 13:09:25,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2018-11-23 13:09:25,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2018-11-23 13:09:25,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2018-11-23 13:09:25,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2018-11-23 13:09:25,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:09:25,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:09:25,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:09:25,964 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:09:25,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:09:26,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:09:26,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:09:26,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:09:26,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:09:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:09:26,110 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:09:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:09:26,110 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:09:26,821 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:09:26,821 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:09:26,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:26 BoogieIcfgContainer [2018-11-23 13:09:26,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:09:26,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:09:26,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:09:26,826 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:09:26,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:09:25" (1/3) ... [2018-11-23 13:09:26,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2a474a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:26, skipping insertion in model container [2018-11-23 13:09:26,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (2/3) ... [2018-11-23 13:09:26,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2a474a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:26, skipping insertion in model container [2018-11-23 13:09:26,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:26" (3/3) ... [2018-11-23 13:09:26,830 INFO L112 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok_true-unreach-call_true-termination.i [2018-11-23 13:09:26,840 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:09:26,848 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:09:26,866 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:09:26,898 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:09:26,899 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:09:26,899 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:09:26,900 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:09:26,900 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:09:26,900 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:09:26,900 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:09:26,901 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:09:26,901 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:09:26,923 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 13:09:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:09:26,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:26,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:26,935 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:26,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:26,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1770779542, now seen corresponding path program 1 times [2018-11-23 13:09:26,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:26,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:26,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:26,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:26,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:27,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 13:09:27,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 13:09:27,452 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #74#return; {31#true} is VALID [2018-11-23 13:09:27,452 INFO L256 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2018-11-23 13:09:27,453 INFO L273 TraceCheckUtils]: 4: Hoare triple {31#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; {31#true} is VALID [2018-11-23 13:09:27,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} assume !!(~leader_len~0 < 1000000); {31#true} is VALID [2018-11-23 13:09:27,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume !!(~bufsize~0 < 1000000); {31#true} is VALID [2018-11-23 13:09:27,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#true} assume !!(~ielen~0 < 1000000); {31#true} is VALID [2018-11-23 13:09:27,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#true} assume ~leader_len~0 > 0; {33#(<= 1 main_~leader_len~0)} is VALID [2018-11-23 13:09:27,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#(<= 1 main_~leader_len~0)} assume ~bufsize~0 > 0; {33#(<= 1 main_~leader_len~0)} is VALID [2018-11-23 13:09:27,467 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#(<= 1 main_~leader_len~0)} assume ~ielen~0 > 0; {33#(<= 1 main_~leader_len~0)} is VALID [2018-11-23 13:09:27,474 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#(<= 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; {34#(<= 1 main_~p~0)} is VALID [2018-11-23 13:09:27,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#(<= 1 main_~p~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {34#(<= 1 main_~p~0)} is VALID [2018-11-23 13:09:27,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#(<= 1 main_~p~0)} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {34#(<= 1 main_~p~0)} is VALID [2018-11-23 13:09:27,491 INFO L256 TraceCheckUtils]: 14: Hoare triple {34#(<= 1 main_~p~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {35#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:27,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {36#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:09:27,520 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {32#false} is VALID [2018-11-23 13:09:27,520 INFO L273 TraceCheckUtils]: 17: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 13:09:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:27,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:27,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:09:27,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 13:09:27,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:27,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:09:27,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:27,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:09:27,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:09:27,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:09:27,620 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 6 states. [2018-11-23 13:09:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:28,527 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2018-11-23 13:09:28,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:09:28,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 13:09:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:09:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 13:09:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:09:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 13:09:28,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2018-11-23 13:09:28,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:28,775 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:09:28,775 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:09:28,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:09:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:09:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:09:28,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:28,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:09:28,833 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:09:28,834 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:09:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:28,838 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:09:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:09:28,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:28,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:28,839 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:09:28,840 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:09:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:28,843 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:09:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:09:28,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:28,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:28,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:28,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:09:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 13:09:28,850 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 18 [2018-11-23 13:09:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:28,850 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 13:09:28,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:09:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:09:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:09:28,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:28,854 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:28,854 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:28,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:28,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1769173835, now seen corresponding path program 1 times [2018-11-23 13:09:28,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:28,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:28,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:28,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:28,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:29,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2018-11-23 13:09:29,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 13:09:29,051 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} #74#return; {204#true} is VALID [2018-11-23 13:09:29,051 INFO L256 TraceCheckUtils]: 3: Hoare triple {204#true} call #t~ret5 := main(); {204#true} is VALID [2018-11-23 13:09:29,052 INFO L273 TraceCheckUtils]: 4: Hoare triple {204#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; {204#true} is VALID [2018-11-23 13:09:29,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#true} assume !!(~leader_len~0 < 1000000); {204#true} is VALID [2018-11-23 13:09:29,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {204#true} assume !!(~bufsize~0 < 1000000); {204#true} is VALID [2018-11-23 13:09:29,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {204#true} assume !!(~ielen~0 < 1000000); {204#true} is VALID [2018-11-23 13:09:29,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {204#true} assume ~leader_len~0 > 0; {204#true} is VALID [2018-11-23 13:09:29,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {204#true} assume ~bufsize~0 > 0; {204#true} is VALID [2018-11-23 13:09:29,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {204#true} assume ~ielen~0 > 0; {204#true} is VALID [2018-11-23 13:09:29,069 INFO L273 TraceCheckUtils]: 11: Hoare triple {204#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; {206#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:29,071 INFO L273 TraceCheckUtils]: 12: Hoare triple {206#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {206#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:29,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {206#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {207#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:29,074 INFO L256 TraceCheckUtils]: 14: Hoare triple {207#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {204#true} is VALID [2018-11-23 13:09:29,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {204#true} ~cond := #in~cond; {208#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:29,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {208#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {209#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:29,078 INFO L273 TraceCheckUtils]: 17: Hoare triple {209#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {209#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:29,078 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {209#(not (= |__VERIFIER_assert_#in~cond| 0))} {207#(<= (+ main_~p~0 3) main_~bufsize_0~0)} #78#return; {207#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:29,098 INFO L256 TraceCheckUtils]: 19: Hoare triple {207#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {209#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:29,103 INFO L273 TraceCheckUtils]: 20: Hoare triple {209#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {210#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:29,103 INFO L273 TraceCheckUtils]: 21: Hoare triple {210#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {205#false} is VALID [2018-11-23 13:09:29,103 INFO L273 TraceCheckUtils]: 22: Hoare triple {205#false} assume !false; {205#false} is VALID [2018-11-23 13:09:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:29,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:29,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:29,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:29,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:29,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2018-11-23 13:09:29,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 13:09:29,460 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} #74#return; {204#true} is VALID [2018-11-23 13:09:29,461 INFO L256 TraceCheckUtils]: 3: Hoare triple {204#true} call #t~ret5 := main(); {204#true} is VALID [2018-11-23 13:09:29,461 INFO L273 TraceCheckUtils]: 4: Hoare triple {204#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; {204#true} is VALID [2018-11-23 13:09:29,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#true} assume !!(~leader_len~0 < 1000000); {204#true} is VALID [2018-11-23 13:09:29,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {204#true} assume !!(~bufsize~0 < 1000000); {204#true} is VALID [2018-11-23 13:09:29,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {204#true} assume !!(~ielen~0 < 1000000); {204#true} is VALID [2018-11-23 13:09:29,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {204#true} assume ~leader_len~0 > 0; {204#true} is VALID [2018-11-23 13:09:29,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {204#true} assume ~bufsize~0 > 0; {204#true} is VALID [2018-11-23 13:09:29,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {204#true} assume ~ielen~0 > 0; {204#true} is VALID [2018-11-23 13:09:29,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {204#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; {206#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:29,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {206#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {206#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:29,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {206#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {207#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:29,493 INFO L256 TraceCheckUtils]: 14: Hoare triple {207#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {204#true} is VALID [2018-11-23 13:09:29,494 INFO L273 TraceCheckUtils]: 15: Hoare triple {204#true} ~cond := #in~cond; {204#true} is VALID [2018-11-23 13:09:29,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {204#true} assume !(0 == ~cond); {204#true} is VALID [2018-11-23 13:09:29,494 INFO L273 TraceCheckUtils]: 17: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 13:09:29,509 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {204#true} {207#(<= (+ main_~p~0 3) main_~bufsize_0~0)} #78#return; {207#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:29,518 INFO L256 TraceCheckUtils]: 19: Hoare triple {207#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {271#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:29,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {271#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {275#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:29,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {275#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {205#false} is VALID [2018-11-23 13:09:29,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {205#false} assume !false; {205#false} is VALID [2018-11-23 13:09:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:29,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:09:29,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-23 13:09:29,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 13:09:29,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:29,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:09:29,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:29,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:09:29,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:09:29,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:09:29,707 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2018-11-23 13:09:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:30,241 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 13:09:30,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:09:30,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 13:09:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:09:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2018-11-23 13:09:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:09:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2018-11-23 13:09:30,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2018-11-23 13:09:30,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:30,318 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:09:30,318 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:09:30,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:09:30,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:09:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 13:09:30,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:30,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 13:09:30,365 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 13:09:30,365 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 13:09:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:30,370 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 13:09:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 13:09:30,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:30,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:30,371 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 13:09:30,371 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 13:09:30,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:30,375 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 13:09:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 13:09:30,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:30,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:30,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:30,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:09:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 13:09:30,379 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 23 [2018-11-23 13:09:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:30,380 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 13:09:30,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:09:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 13:09:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:09:30,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:30,382 INFO L402 BasicCegarLoop]: 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] [2018-11-23 13:09:30,383 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:30,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:30,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1089945877, now seen corresponding path program 1 times [2018-11-23 13:09:30,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:30,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:30,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:30,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:30,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:30,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {458#true} is VALID [2018-11-23 13:09:30,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-23 13:09:30,611 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} #74#return; {458#true} is VALID [2018-11-23 13:09:30,611 INFO L256 TraceCheckUtils]: 3: Hoare triple {458#true} call #t~ret5 := main(); {458#true} is VALID [2018-11-23 13:09:30,612 INFO L273 TraceCheckUtils]: 4: Hoare triple {458#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; {458#true} is VALID [2018-11-23 13:09:30,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {458#true} assume !!(~leader_len~0 < 1000000); {458#true} is VALID [2018-11-23 13:09:30,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {458#true} assume !!(~bufsize~0 < 1000000); {458#true} is VALID [2018-11-23 13:09:30,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {458#true} assume !!(~ielen~0 < 1000000); {458#true} is VALID [2018-11-23 13:09:30,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {458#true} assume ~leader_len~0 > 0; {458#true} is VALID [2018-11-23 13:09:30,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {458#true} assume ~bufsize~0 > 0; {458#true} is VALID [2018-11-23 13:09:30,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {458#true} assume ~ielen~0 > 0; {458#true} is VALID [2018-11-23 13:09:30,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {458#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; {460#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:30,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {460#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:09:30,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:09:30,625 INFO L256 TraceCheckUtils]: 14: Hoare triple {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {458#true} is VALID [2018-11-23 13:09:30,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {458#true} ~cond := #in~cond; {462#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:30,626 INFO L273 TraceCheckUtils]: 16: Hoare triple {462#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {463#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:30,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {463#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {463#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:30,631 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {463#(not (= |__VERIFIER_assert_#in~cond| 0))} {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} #78#return; {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:09:30,631 INFO L256 TraceCheckUtils]: 19: Hoare triple {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {458#true} is VALID [2018-11-23 13:09:30,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2018-11-23 13:09:30,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2018-11-23 13:09:30,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-23 13:09:30,635 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {458#true} {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} #80#return; {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:09:30,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} ~p~0 := 2 + ~p~0; {464#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0) 2))} is VALID [2018-11-23 13:09:30,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {464#(<= (+ 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; {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:09:30,646 INFO L273 TraceCheckUtils]: 26: Hoare triple {461#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {465#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:30,646 INFO L256 TraceCheckUtils]: 27: Hoare triple {465#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {458#true} is VALID [2018-11-23 13:09:30,646 INFO L273 TraceCheckUtils]: 28: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2018-11-23 13:09:30,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2018-11-23 13:09:30,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-23 13:09:30,647 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {458#true} {465#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #78#return; {465#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:30,648 INFO L256 TraceCheckUtils]: 32: Hoare triple {465#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {463#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:30,649 INFO L273 TraceCheckUtils]: 33: Hoare triple {463#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {466#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:30,649 INFO L273 TraceCheckUtils]: 34: Hoare triple {466#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {459#false} is VALID [2018-11-23 13:09:30,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {459#false} assume !false; {459#false} is VALID [2018-11-23 13:09:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 13:09:30,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:30,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:30,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:30,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:31,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {458#true} is VALID [2018-11-23 13:09:31,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-23 13:09:31,027 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} #74#return; {458#true} is VALID [2018-11-23 13:09:31,027 INFO L256 TraceCheckUtils]: 3: Hoare triple {458#true} call #t~ret5 := main(); {458#true} is VALID [2018-11-23 13:09:31,027 INFO L273 TraceCheckUtils]: 4: Hoare triple {458#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; {458#true} is VALID [2018-11-23 13:09:31,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {458#true} assume !!(~leader_len~0 < 1000000); {458#true} is VALID [2018-11-23 13:09:31,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {458#true} assume !!(~bufsize~0 < 1000000); {458#true} is VALID [2018-11-23 13:09:31,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {458#true} assume !!(~ielen~0 < 1000000); {458#true} is VALID [2018-11-23 13:09:31,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {458#true} assume ~leader_len~0 > 0; {458#true} is VALID [2018-11-23 13:09:31,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {458#true} assume ~bufsize~0 > 0; {458#true} is VALID [2018-11-23 13:09:31,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {458#true} assume ~ielen~0 > 0; {458#true} is VALID [2018-11-23 13:09:31,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {458#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; {460#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:31,034 INFO L273 TraceCheckUtils]: 12: Hoare triple {460#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {506#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} is VALID [2018-11-23 13:09:31,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {506#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {506#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} is VALID [2018-11-23 13:09:31,035 INFO L256 TraceCheckUtils]: 14: Hoare triple {506#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {458#true} is VALID [2018-11-23 13:09:31,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2018-11-23 13:09:31,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2018-11-23 13:09:31,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-23 13:09:31,037 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {458#true} {506#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} #78#return; {506#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} is VALID [2018-11-23 13:09:31,037 INFO L256 TraceCheckUtils]: 19: Hoare triple {506#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {458#true} is VALID [2018-11-23 13:09:31,037 INFO L273 TraceCheckUtils]: 20: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2018-11-23 13:09:31,038 INFO L273 TraceCheckUtils]: 21: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2018-11-23 13:09:31,038 INFO L273 TraceCheckUtils]: 22: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-23 13:09:31,051 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {458#true} {506#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} #80#return; {506#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} is VALID [2018-11-23 13:09:31,056 INFO L273 TraceCheckUtils]: 24: Hoare triple {506#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} ~p~0 := 2 + ~p~0; {543#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)))} is VALID [2018-11-23 13:09:31,058 INFO L273 TraceCheckUtils]: 25: Hoare triple {543#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {547#(and (<= 1 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)))} is VALID [2018-11-23 13:09:31,059 INFO L273 TraceCheckUtils]: 26: Hoare triple {547#(and (<= 1 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {465#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:31,059 INFO L256 TraceCheckUtils]: 27: Hoare triple {465#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {458#true} is VALID [2018-11-23 13:09:31,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2018-11-23 13:09:31,060 INFO L273 TraceCheckUtils]: 29: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2018-11-23 13:09:31,060 INFO L273 TraceCheckUtils]: 30: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-23 13:09:31,063 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {458#true} {465#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #78#return; {465#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2018-11-23 13:09:31,064 INFO L256 TraceCheckUtils]: 32: Hoare triple {465#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {569#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:31,064 INFO L273 TraceCheckUtils]: 33: Hoare triple {569#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {573#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:31,065 INFO L273 TraceCheckUtils]: 34: Hoare triple {573#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {459#false} is VALID [2018-11-23 13:09:31,065 INFO L273 TraceCheckUtils]: 35: Hoare triple {459#false} assume !false; {459#false} is VALID [2018-11-23 13:09:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:09:31,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:31,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 13:09:31,088 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-11-23 13:09:31,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:31,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:09:31,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:31,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:09:31,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:09:31,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:09:31,158 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 14 states. [2018-11-23 13:09:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:32,181 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-23 13:09:32,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:09:32,181 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-11-23 13:09:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:09:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2018-11-23 13:09:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:09:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2018-11-23 13:09:32,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 41 transitions. [2018-11-23 13:09:32,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:32,251 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:09:32,251 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:09:32,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:09:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:09:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:09:32,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:32,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:32,254 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:32,254 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:32,254 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:32,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:32,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:32,255 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:32,255 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:32,256 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:32,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:32,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:32,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:32,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:09:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:09:32,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-23 13:09:32,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:32,257 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:09:32,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:09:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:32,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:32,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:09:32,480 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:09:32,480 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:32,480 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:32,480 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:09:32,481 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:09:32,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:09:32,481 INFO L448 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2018-11-23 13:09:32,481 INFO L444 ceAbstractionStarter]: At program point L35-3(lines 35 39) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0))) (<= 1 main_~leader_len~0) (<= 1 main_~p~0)) [2018-11-23 13:09:32,481 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-11-23 13:09:32,481 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-23 13:09:32,481 INFO L451 ceAbstractionStarter]: At program point L40(lines 10 42) the Hoare annotation is: true [2018-11-23 13:09:32,481 INFO L444 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0))) (<= 1 main_~leader_len~0) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~p~0)) [2018-11-23 13:09:32,482 INFO L444 ceAbstractionStarter]: At program point L36-1(line 36) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0))) (<= 1 main_~leader_len~0) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~p~0)) [2018-11-23 13:09:32,482 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-23 13:09:32,482 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 11 42) no Hoare annotation was computed. [2018-11-23 13:09:32,482 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-23 13:09:32,482 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 34) no Hoare annotation was computed. [2018-11-23 13:09:32,482 INFO L448 ceAbstractionStarter]: For program point L25(lines 11 42) no Hoare annotation was computed. [2018-11-23 13:09:32,482 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-23 13:09:32,482 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-11-23 13:09:32,483 INFO L448 ceAbstractionStarter]: For program point L26(lines 11 42) no Hoare annotation was computed. [2018-11-23 13:09:32,483 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-23 13:09:32,483 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:09:32,483 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:09:32,483 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:09:32,483 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:09:32,485 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:09:32,485 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:09:32,486 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:09:32,486 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:09:32,487 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:32,487 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:09:32,487 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:32,487 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:09:32,487 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:09:32,487 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:32,487 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:32,487 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:32,487 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:09:32,487 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:09:32,488 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:09:32,488 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:09:32,488 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:09:32,488 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:09:32,488 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:09:32,488 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 13:09:32,488 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 13:09:32,488 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:32,488 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:32,488 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:09:32,488 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:09:32,489 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 13:09:32,489 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 13:09:32,489 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-23 13:09:32,489 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-23 13:09:32,489 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2018-11-23 13:09:32,489 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:09:32,489 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:09:32,490 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 13:09:32,491 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 13:09:32,491 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 13:09:32,491 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 13:09:32,491 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:09:32,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:09:32 BoogieIcfgContainer [2018-11-23 13:09:32,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:09:32,502 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:09:32,502 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:09:32,502 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:09:32,502 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:26" (3/4) ... [2018-11-23 13:09:32,505 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:09:32,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:09:32,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:09:32,512 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:09:32,517 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:09:32,517 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:09:32,518 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:09:32,572 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/MADWiFi-encode_ie_ok_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:09:32,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:09:32,573 INFO L168 Benchmark]: Toolchain (without parser) took 6962.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -320.5 MB). Peak memory consumption was 399.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:32,575 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:32,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:32,576 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:32,577 INFO L168 Benchmark]: Boogie Preprocessor took 37.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:32,577 INFO L168 Benchmark]: RCFGBuilder took 858.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -756.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:32,578 INFO L168 Benchmark]: TraceAbstraction took 5678.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 425.1 MB). Peak memory consumption was 425.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:32,579 INFO L168 Benchmark]: Witness Printer took 70.34 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:32,582 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 285.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 858.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -756.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5678.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 425.1 MB). Peak memory consumption was 425.1 MB. Max. memory is 7.1 GB. * Witness Printer took 70.34 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (p + 2 * ielen <= bufsize_0 + 2 * i && 1 <= leader_len) && 1 <= p - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 5.5s OverallTime, 3 OverallIterations, 4 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 71 SDtfs, 46 SDslu, 285 SDs, 0 SdLazy, 221 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 16 PreInvPairs, 28 NumberOfFragments, 70 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 156 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 10924 SizeOfPredicates, 10 NumberOfNonLiveVariables, 140 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 33/46 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...