/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:51:10,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:51:10,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:51:10,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:51:10,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:51:10,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:51:10,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:51:10,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:51:10,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:51:10,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:51:10,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:51:10,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:51:10,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:51:10,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:51:10,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:51:10,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:51:10,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:51:10,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:51:10,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:51:10,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:51:10,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:51:10,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:51:10,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:51:10,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:51:10,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:51:10,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:51:10,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:51:10,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:51:10,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:51:10,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:51:10,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:51:10,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:51:10,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:51:10,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:51:10,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:51:10,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:51:10,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:51:10,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:51:10,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:51:10,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:51:10,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:51:10,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:51:10,586 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:51:10,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:51:10,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:51:10,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:51:10,588 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:51:10,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:51:10,589 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:51:10,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:51:10,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:51:10,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:51:10,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:51:10,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:51:10,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:51:10,590 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:51:10,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:51:10,590 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:51:10,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:51:10,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:51:10,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:51:10,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:51:10,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:51:10,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:10,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:51:10,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:51:10,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:51:10,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:51:10,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:51:10,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:51:10,593 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:51:10,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:51:10,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:51:10,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:51:10,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:51:10,920 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:51:10,920 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:51:10,921 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2020-07-17 22:51:11,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ef064ff/aa4d9a02a7eb45a6874b74e5136c6c84/FLAGd7375a5b3 [2020-07-17 22:51:11,544 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:51:11,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2020-07-17 22:51:11,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ef064ff/aa4d9a02a7eb45a6874b74e5136c6c84/FLAGd7375a5b3 [2020-07-17 22:51:11,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ef064ff/aa4d9a02a7eb45a6874b74e5136c6c84 [2020-07-17 22:51:11,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:51:11,951 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:51:11,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:11,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:51:11,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:51:11,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:11" (1/1) ... [2020-07-17 22:51:11,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b684826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:11, skipping insertion in model container [2020-07-17 22:51:11,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:11" (1/1) ... [2020-07-17 22:51:11,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:51:11,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:51:12,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:12,184 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:51:12,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:12,232 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:51:12,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12 WrapperNode [2020-07-17 22:51:12,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:12,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:51:12,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:51:12,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:51:12,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:51:12,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:51:12,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:51:12,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:51:12,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (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 [2020-07-17 22:51:12,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:51:12,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:51:12,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:51:12,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:51:12,433 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:51:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:51:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:51:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:51:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:51:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:51:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:51:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:51:12,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:51:12,888 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:51:12,888 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:51:12,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:12 BoogieIcfgContainer [2020-07-17 22:51:12,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:51:12,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:51:12,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:51:12,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:51:12,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:51:11" (1/3) ... [2020-07-17 22:51:12,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a23bca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:12, skipping insertion in model container [2020-07-17 22:51:12,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (2/3) ... [2020-07-17 22:51:12,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a23bca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:12, skipping insertion in model container [2020-07-17 22:51:12,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:12" (3/3) ... [2020-07-17 22:51:12,908 INFO L109 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2020-07-17 22:51:12,920 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:51:12,930 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:51:12,943 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:51:12,967 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:51:12,967 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:51:12,967 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:51:12,967 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:51:12,968 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:51:12,968 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:51:12,968 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:51:12,968 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:51:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-17 22:51:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:51:12,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:12,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:12,994 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:12,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:13,000 INFO L82 PathProgramCache]: Analyzing trace with hash 921445730, now seen corresponding path program 1 times [2020-07-17 22:51:13,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:13,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228590993] [2020-07-17 22:51:13,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:13,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-17 22:51:13,302 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {31#true} {31#true} #82#return; {31#true} is VALID [2020-07-17 22:51:13,305 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2020-07-17 22:51:13,305 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-17 22:51:13,306 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #82#return; {31#true} is VALID [2020-07-17 22:51:13,306 INFO L263 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret4 := main(); {31#true} is VALID [2020-07-17 22:51:13,307 INFO L280 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~nondet0 && #t~nondet0 <= 2147483647;~leader_len~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~ielen~0 := #t~nondet2;havoc #t~nondet2; {31#true} is VALID [2020-07-17 22:51:13,307 INFO L280 TraceCheckUtils]: 5: Hoare triple {31#true} assume !!(~leader_len~0 < 1000000); {31#true} is VALID [2020-07-17 22:51:13,308 INFO L280 TraceCheckUtils]: 6: Hoare triple {31#true} assume !!(~bufsize~0 < 1000000); {31#true} is VALID [2020-07-17 22:51:13,308 INFO L280 TraceCheckUtils]: 7: Hoare triple {31#true} assume !!(~ielen~0 < 1000000); {31#true} is VALID [2020-07-17 22:51:13,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {31#true} assume ~leader_len~0 > 0; {35#(<= 1 main_~leader_len~0)} is VALID [2020-07-17 22:51:13,313 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#(<= 1 main_~leader_len~0)} assume ~bufsize~0 > 0; {35#(<= 1 main_~leader_len~0)} is VALID [2020-07-17 22:51:13,315 INFO L280 TraceCheckUtils]: 10: Hoare triple {35#(<= 1 main_~leader_len~0)} assume ~ielen~0 > 0; {35#(<= 1 main_~leader_len~0)} is VALID [2020-07-17 22:51:13,317 INFO L280 TraceCheckUtils]: 11: Hoare triple {35#(<= 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; {36#(<= 1 main_~p~0)} is VALID [2020-07-17 22:51:13,319 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#(<= 1 main_~p~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {36#(<= 1 main_~p~0)} is VALID [2020-07-17 22:51:13,320 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#(<= 1 main_~p~0)} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {36#(<= 1 main_~p~0)} is VALID [2020-07-17 22:51:13,322 INFO L263 TraceCheckUtils]: 14: Hoare triple {36#(<= 1 main_~p~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:13,324 INFO L280 TraceCheckUtils]: 15: Hoare triple {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {38#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:13,325 INFO L280 TraceCheckUtils]: 16: Hoare triple {38#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {32#false} is VALID [2020-07-17 22:51:13,326 INFO L280 TraceCheckUtils]: 17: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-17 22:51:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:13,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228590993] [2020-07-17 22:51:13,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:13,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:13,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654368406] [2020-07-17 22:51:13,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-17 22:51:13,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:13,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:13,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:13,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:13,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:13,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:13,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:13,406 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 6 states. [2020-07-17 22:51:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:13,892 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2020-07-17 22:51:13,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:13,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-17 22:51:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-17 22:51:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-17 22:51:13,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2020-07-17 22:51:14,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:14,068 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:51:14,068 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:51:14,073 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:51:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:51:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-17 22:51:14,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:14,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-17 22:51:14,133 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-17 22:51:14,134 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-17 22:51:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:14,138 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-17 22:51:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-17 22:51:14,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:14,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:14,140 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-17 22:51:14,140 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-17 22:51:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:14,145 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-17 22:51:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-17 22:51:14,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:14,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:14,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:14,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:51:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-17 22:51:14,151 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 18 [2020-07-17 22:51:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:14,152 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-17 22:51:14,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-17 22:51:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:51:14,153 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:14,154 INFO L422 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] [2020-07-17 22:51:14,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:51:14,154 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:14,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:14,155 INFO L82 PathProgramCache]: Analyzing trace with hash 487181509, now seen corresponding path program 1 times [2020-07-17 22:51:14,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:14,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070105082] [2020-07-17 22:51:14,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,291 INFO L280 TraceCheckUtils]: 0: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-17 22:51:14,292 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {206#true} {206#true} #82#return; {206#true} is VALID [2020-07-17 22:51:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2020-07-17 22:51:14,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2020-07-17 22:51:14,304 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-17 22:51:14,305 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {206#true} {211#(<= (+ main_~p~0 3) main_~bufsize_0~0)} #86#return; {211#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:14,306 INFO L263 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {206#true} is VALID [2020-07-17 22:51:14,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-17 22:51:14,307 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #82#return; {206#true} is VALID [2020-07-17 22:51:14,307 INFO L263 TraceCheckUtils]: 3: Hoare triple {206#true} call #t~ret4 := main(); {206#true} is VALID [2020-07-17 22:51:14,307 INFO L280 TraceCheckUtils]: 4: Hoare triple {206#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~leader_len~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~ielen~0 := #t~nondet2;havoc #t~nondet2; {206#true} is VALID [2020-07-17 22:51:14,308 INFO L280 TraceCheckUtils]: 5: Hoare triple {206#true} assume !!(~leader_len~0 < 1000000); {206#true} is VALID [2020-07-17 22:51:14,308 INFO L280 TraceCheckUtils]: 6: Hoare triple {206#true} assume !!(~bufsize~0 < 1000000); {206#true} is VALID [2020-07-17 22:51:14,308 INFO L280 TraceCheckUtils]: 7: Hoare triple {206#true} assume !!(~ielen~0 < 1000000); {206#true} is VALID [2020-07-17 22:51:14,309 INFO L280 TraceCheckUtils]: 8: Hoare triple {206#true} assume ~leader_len~0 > 0; {206#true} is VALID [2020-07-17 22:51:14,309 INFO L280 TraceCheckUtils]: 9: Hoare triple {206#true} assume ~bufsize~0 > 0; {206#true} is VALID [2020-07-17 22:51:14,309 INFO L280 TraceCheckUtils]: 10: Hoare triple {206#true} assume ~ielen~0 > 0; {206#true} is VALID [2020-07-17 22:51:14,311 INFO L280 TraceCheckUtils]: 11: Hoare triple {206#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; {210#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:14,312 INFO L280 TraceCheckUtils]: 12: Hoare triple {210#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {210#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:14,313 INFO L280 TraceCheckUtils]: 13: Hoare triple {210#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {211#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:14,313 INFO L263 TraceCheckUtils]: 14: Hoare triple {211#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {206#true} is VALID [2020-07-17 22:51:14,314 INFO L280 TraceCheckUtils]: 15: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2020-07-17 22:51:14,314 INFO L280 TraceCheckUtils]: 16: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2020-07-17 22:51:14,314 INFO L280 TraceCheckUtils]: 17: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-17 22:51:14,316 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {206#true} {211#(<= (+ main_~p~0 3) main_~bufsize_0~0)} #86#return; {211#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:14,318 INFO L263 TraceCheckUtils]: 19: Hoare triple {211#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {216#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:14,319 INFO L280 TraceCheckUtils]: 20: Hoare triple {216#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {217#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:14,320 INFO L280 TraceCheckUtils]: 21: Hoare triple {217#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {207#false} is VALID [2020-07-17 22:51:14,320 INFO L280 TraceCheckUtils]: 22: Hoare triple {207#false} assume !false; {207#false} is VALID [2020-07-17 22:51:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:14,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070105082] [2020-07-17 22:51:14,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:14,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:14,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175764386] [2020-07-17 22:51:14,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:51:14,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:14,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:14,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:14,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:14,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:14,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:14,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:14,361 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 6 states. [2020-07-17 22:51:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:14,635 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-17 22:51:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:14,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:51:14,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:14,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2020-07-17 22:51:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2020-07-17 22:51:14,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2020-07-17 22:51:14,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:14,701 INFO L225 Difference]: With dead ends: 38 [2020-07-17 22:51:14,701 INFO L226 Difference]: Without dead ends: 36 [2020-07-17 22:51:14,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:51:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-17 22:51:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-17 22:51:14,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:14,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-17 22:51:14,731 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-17 22:51:14,731 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-17 22:51:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:14,737 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-17 22:51:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-17 22:51:14,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:14,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:14,738 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-17 22:51:14,738 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-17 22:51:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:14,742 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-17 22:51:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-17 22:51:14,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:14,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:14,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:14,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:51:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-07-17 22:51:14,748 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 23 [2020-07-17 22:51:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:14,748 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-07-17 22:51:14,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-17 22:51:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 22:51:14,750 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:14,751 INFO L422 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] [2020-07-17 22:51:14,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:51:14,751 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:14,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash 258938125, now seen corresponding path program 1 times [2020-07-17 22:51:14,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:14,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156153086] [2020-07-17 22:51:14,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,922 INFO L280 TraceCheckUtils]: 0: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:14,922 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {395#true} {395#true} #82#return; {395#true} is VALID [2020-07-17 22:51:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {395#true} ~cond := #in~cond; {395#true} is VALID [2020-07-17 22:51:14,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {395#true} assume !(0 == ~cond); {395#true} is VALID [2020-07-17 22:51:14,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:14,935 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {395#true} {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} #86#return; {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-17 22:51:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {395#true} ~cond := #in~cond; {395#true} is VALID [2020-07-17 22:51:14,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {395#true} assume !(0 == ~cond); {395#true} is VALID [2020-07-17 22:51:14,945 INFO L280 TraceCheckUtils]: 2: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:14,947 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {395#true} {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} #88#return; {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-17 22:51:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {395#true} ~cond := #in~cond; {395#true} is VALID [2020-07-17 22:51:14,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {395#true} assume !(0 == ~cond); {395#true} is VALID [2020-07-17 22:51:14,958 INFO L280 TraceCheckUtils]: 2: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:14,959 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {395#true} {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #86#return; {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:14,960 INFO L263 TraceCheckUtils]: 0: Hoare triple {395#true} call ULTIMATE.init(); {395#true} is VALID [2020-07-17 22:51:14,960 INFO L280 TraceCheckUtils]: 1: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:14,961 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {395#true} {395#true} #82#return; {395#true} is VALID [2020-07-17 22:51:14,961 INFO L263 TraceCheckUtils]: 3: Hoare triple {395#true} call #t~ret4 := main(); {395#true} is VALID [2020-07-17 22:51:14,962 INFO L280 TraceCheckUtils]: 4: Hoare triple {395#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~leader_len~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~ielen~0 := #t~nondet2;havoc #t~nondet2; {395#true} is VALID [2020-07-17 22:51:14,962 INFO L280 TraceCheckUtils]: 5: Hoare triple {395#true} assume !!(~leader_len~0 < 1000000); {395#true} is VALID [2020-07-17 22:51:14,963 INFO L280 TraceCheckUtils]: 6: Hoare triple {395#true} assume !!(~bufsize~0 < 1000000); {395#true} is VALID [2020-07-17 22:51:14,963 INFO L280 TraceCheckUtils]: 7: Hoare triple {395#true} assume !!(~ielen~0 < 1000000); {395#true} is VALID [2020-07-17 22:51:14,963 INFO L280 TraceCheckUtils]: 8: Hoare triple {395#true} assume ~leader_len~0 > 0; {395#true} is VALID [2020-07-17 22:51:14,964 INFO L280 TraceCheckUtils]: 9: Hoare triple {395#true} assume ~bufsize~0 > 0; {395#true} is VALID [2020-07-17 22:51:14,964 INFO L280 TraceCheckUtils]: 10: Hoare triple {395#true} assume ~ielen~0 > 0; {395#true} is VALID [2020-07-17 22:51:14,966 INFO L280 TraceCheckUtils]: 11: Hoare triple {395#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; {399#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:14,967 INFO L280 TraceCheckUtils]: 12: Hoare triple {399#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-17 22:51:14,968 INFO L280 TraceCheckUtils]: 13: Hoare triple {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-17 22:51:14,969 INFO L263 TraceCheckUtils]: 14: Hoare triple {400#(<= (+ 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)); {395#true} is VALID [2020-07-17 22:51:14,969 INFO L280 TraceCheckUtils]: 15: Hoare triple {395#true} ~cond := #in~cond; {395#true} is VALID [2020-07-17 22:51:14,970 INFO L280 TraceCheckUtils]: 16: Hoare triple {395#true} assume !(0 == ~cond); {395#true} is VALID [2020-07-17 22:51:14,970 INFO L280 TraceCheckUtils]: 17: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:14,971 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {395#true} {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} #86#return; {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-17 22:51:14,972 INFO L263 TraceCheckUtils]: 19: Hoare triple {400#(<= (+ 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)); {395#true} is VALID [2020-07-17 22:51:14,972 INFO L280 TraceCheckUtils]: 20: Hoare triple {395#true} ~cond := #in~cond; {395#true} is VALID [2020-07-17 22:51:14,973 INFO L280 TraceCheckUtils]: 21: Hoare triple {395#true} assume !(0 == ~cond); {395#true} is VALID [2020-07-17 22:51:14,973 INFO L280 TraceCheckUtils]: 22: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:14,975 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {395#true} {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} #88#return; {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-17 22:51:14,977 INFO L280 TraceCheckUtils]: 24: Hoare triple {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} ~p~0 := 2 + ~p~0; {409#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0) 2))} is VALID [2020-07-17 22:51:14,979 INFO L280 TraceCheckUtils]: 25: Hoare triple {409#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0) 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-17 22:51:14,980 INFO L280 TraceCheckUtils]: 26: Hoare triple {400#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:14,981 INFO L263 TraceCheckUtils]: 27: Hoare triple {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {395#true} is VALID [2020-07-17 22:51:14,981 INFO L280 TraceCheckUtils]: 28: Hoare triple {395#true} ~cond := #in~cond; {395#true} is VALID [2020-07-17 22:51:14,982 INFO L280 TraceCheckUtils]: 29: Hoare triple {395#true} assume !(0 == ~cond); {395#true} is VALID [2020-07-17 22:51:14,982 INFO L280 TraceCheckUtils]: 30: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:14,984 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {395#true} {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #86#return; {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:14,986 INFO L263 TraceCheckUtils]: 32: Hoare triple {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {415#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:14,987 INFO L280 TraceCheckUtils]: 33: Hoare triple {415#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {416#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:14,988 INFO L280 TraceCheckUtils]: 34: Hoare triple {416#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {396#false} is VALID [2020-07-17 22:51:14,989 INFO L280 TraceCheckUtils]: 35: Hoare triple {396#false} assume !false; {396#false} is VALID [2020-07-17 22:51:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-17 22:51:14,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156153086] [2020-07-17 22:51:14,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429761128] [2020-07-17 22:51:14,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:15,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-17 22:51:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:15,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:15,379 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:15,450 INFO L263 TraceCheckUtils]: 0: Hoare triple {395#true} call ULTIMATE.init(); {395#true} is VALID [2020-07-17 22:51:15,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:15,451 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {395#true} {395#true} #82#return; {395#true} is VALID [2020-07-17 22:51:15,451 INFO L263 TraceCheckUtils]: 3: Hoare triple {395#true} call #t~ret4 := main(); {395#true} is VALID [2020-07-17 22:51:15,451 INFO L280 TraceCheckUtils]: 4: Hoare triple {395#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~leader_len~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~ielen~0 := #t~nondet2;havoc #t~nondet2; {395#true} is VALID [2020-07-17 22:51:15,452 INFO L280 TraceCheckUtils]: 5: Hoare triple {395#true} assume !!(~leader_len~0 < 1000000); {395#true} is VALID [2020-07-17 22:51:15,452 INFO L280 TraceCheckUtils]: 6: Hoare triple {395#true} assume !!(~bufsize~0 < 1000000); {395#true} is VALID [2020-07-17 22:51:15,452 INFO L280 TraceCheckUtils]: 7: Hoare triple {395#true} assume !!(~ielen~0 < 1000000); {395#true} is VALID [2020-07-17 22:51:15,453 INFO L280 TraceCheckUtils]: 8: Hoare triple {395#true} assume ~leader_len~0 > 0; {395#true} is VALID [2020-07-17 22:51:15,453 INFO L280 TraceCheckUtils]: 9: Hoare triple {395#true} assume ~bufsize~0 > 0; {395#true} is VALID [2020-07-17 22:51:15,453 INFO L280 TraceCheckUtils]: 10: Hoare triple {395#true} assume ~ielen~0 > 0; {395#true} is VALID [2020-07-17 22:51:15,455 INFO L280 TraceCheckUtils]: 11: Hoare triple {395#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; {399#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:15,457 INFO L280 TraceCheckUtils]: 12: Hoare triple {399#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {456#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} is VALID [2020-07-17 22:51:15,459 INFO L280 TraceCheckUtils]: 13: Hoare triple {456#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {456#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} is VALID [2020-07-17 22:51:15,459 INFO L263 TraceCheckUtils]: 14: Hoare triple {456#(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)); {395#true} is VALID [2020-07-17 22:51:15,460 INFO L280 TraceCheckUtils]: 15: Hoare triple {395#true} ~cond := #in~cond; {395#true} is VALID [2020-07-17 22:51:15,460 INFO L280 TraceCheckUtils]: 16: Hoare triple {395#true} assume !(0 == ~cond); {395#true} is VALID [2020-07-17 22:51:15,461 INFO L280 TraceCheckUtils]: 17: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:15,462 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {395#true} {456#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} #86#return; {456#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} is VALID [2020-07-17 22:51:15,463 INFO L263 TraceCheckUtils]: 19: Hoare triple {456#(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)); {395#true} is VALID [2020-07-17 22:51:15,463 INFO L280 TraceCheckUtils]: 20: Hoare triple {395#true} ~cond := #in~cond; {395#true} is VALID [2020-07-17 22:51:15,463 INFO L280 TraceCheckUtils]: 21: Hoare triple {395#true} assume !(0 == ~cond); {395#true} is VALID [2020-07-17 22:51:15,464 INFO L280 TraceCheckUtils]: 22: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:15,465 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {395#true} {456#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} #88#return; {456#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} is VALID [2020-07-17 22:51:15,467 INFO L280 TraceCheckUtils]: 24: Hoare triple {456#(and (<= 0 main_~i~0) (<= (+ (* 2 main_~ielen~0) main_~p~0) main_~bufsize_0~0))} ~p~0 := 2 + ~p~0; {493#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)))} is VALID [2020-07-17 22:51:15,469 INFO L280 TraceCheckUtils]: 25: Hoare triple {493#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {497#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} is VALID [2020-07-17 22:51:15,471 INFO L280 TraceCheckUtils]: 26: Hoare triple {497#(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); {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:15,471 INFO L263 TraceCheckUtils]: 27: Hoare triple {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {395#true} is VALID [2020-07-17 22:51:15,472 INFO L280 TraceCheckUtils]: 28: Hoare triple {395#true} ~cond := #in~cond; {395#true} is VALID [2020-07-17 22:51:15,472 INFO L280 TraceCheckUtils]: 29: Hoare triple {395#true} assume !(0 == ~cond); {395#true} is VALID [2020-07-17 22:51:15,472 INFO L280 TraceCheckUtils]: 30: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-17 22:51:15,473 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {395#true} {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #86#return; {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2020-07-17 22:51:15,475 INFO L263 TraceCheckUtils]: 32: Hoare triple {410#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:15,477 INFO L280 TraceCheckUtils]: 33: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:15,478 INFO L280 TraceCheckUtils]: 34: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {396#false} is VALID [2020-07-17 22:51:15,478 INFO L280 TraceCheckUtils]: 35: Hoare triple {396#false} assume !false; {396#false} is VALID [2020-07-17 22:51:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 22:51:15,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:15,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2020-07-17 22:51:15,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214017340] [2020-07-17 22:51:15,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2020-07-17 22:51:15,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:15,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:51:15,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:15,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:51:15,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:15,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:51:15,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:51:15,566 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2020-07-17 22:51:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,259 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2020-07-17 22:51:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 22:51:16,262 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2020-07-17 22:51:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:51:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2020-07-17 22:51:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:51:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2020-07-17 22:51:16,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 41 transitions. [2020-07-17 22:51:16,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:16,334 INFO L225 Difference]: With dead ends: 41 [2020-07-17 22:51:16,334 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:51:16,335 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2020-07-17 22:51:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:51:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:51:16,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:16,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:16,336 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:16,337 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,337 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:16,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,338 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:16,338 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,339 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:16,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:16,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:51:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:51:16,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2020-07-17 22:51:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:16,341 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:51:16,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:51:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:16,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:51:16,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:51:16,718 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:51:16,719 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:16,719 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:16,719 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:51:16,719 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:51:16,719 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:16,719 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:16,719 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:51:16,720 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:16,720 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:16,720 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-17 22:51:16,720 INFO L268 CegarLoopResult]: For program point L27-1(lines 14 45) no Hoare annotation was computed. [2020-07-17 22:51:16,720 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 45) no Hoare annotation was computed. [2020-07-17 22:51:16,720 INFO L268 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2020-07-17 22:51:16,721 INFO L268 CegarLoopResult]: For program point L36(lines 36 37) no Hoare annotation was computed. [2020-07-17 22:51:16,721 INFO L268 CegarLoopResult]: For program point L28(lines 14 45) no Hoare annotation was computed. [2020-07-17 22:51:16,721 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-17 22:51:16,721 INFO L268 CegarLoopResult]: For program point L29(lines 14 45) no Hoare annotation was computed. [2020-07-17 22:51:16,721 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-17 22:51:16,721 INFO L268 CegarLoopResult]: For program point L38-2(lines 38 42) no Hoare annotation was computed. [2020-07-17 22:51:16,722 INFO L264 CegarLoopResult]: At program point L38-3(lines 38 42) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0))) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2020-07-17 22:51:16,722 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-07-17 22:51:16,722 INFO L268 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2020-07-17 22:51:16,722 INFO L271 CegarLoopResult]: At program point L43(lines 13 45) the Hoare annotation is: true [2020-07-17 22:51:16,722 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0))) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2020-07-17 22:51:16,723 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0))) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2020-07-17 22:51:16,723 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:51:16,723 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:16,723 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:51:16,723 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:51:16,723 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:16,724 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:51:16,729 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:16,729 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:51:16,730 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:51:16,730 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:16,730 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:16,730 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:16,730 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:16,730 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:16,730 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:51:16,731 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:51:16,731 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:16,731 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:16,731 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:16,731 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:51:16,731 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:16,731 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:51:16,731 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:51:16,732 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:16,732 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:16,732 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:51:16,732 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:16,732 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:51:16,732 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:51:16,732 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:16,732 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:16,733 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:51:16,733 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:51:16,733 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:51:16,733 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:51:16,733 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-17 22:51:16,733 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-17 22:51:16,733 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-17 22:51:16,734 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:51:16,734 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:51:16,735 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:51:16,735 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:51:16,735 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-17 22:51:16,736 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-17 22:51:16,736 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. [2020-07-17 22:51:16,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:16 BoogieIcfgContainer [2020-07-17 22:51:16,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:16,753 INFO L168 Benchmark]: Toolchain (without parser) took 4802.57 ms. Allocated memory was 145.2 MB in the beginning and 247.5 MB in the end (delta: 102.2 MB). Free memory was 101.5 MB in the beginning and 170.5 MB in the end (delta: -69.0 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:16,754 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:16,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.97 ms. Allocated memory is still 145.2 MB. Free memory was 101.1 MB in the beginning and 91.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:16,757 INFO L168 Benchmark]: Boogie Preprocessor took 127.38 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 91.0 MB in the beginning and 180.6 MB in the end (delta: -89.6 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:16,757 INFO L168 Benchmark]: RCFGBuilder took 535.83 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 158.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:16,758 INFO L168 Benchmark]: TraceAbstraction took 3850.74 ms. Allocated memory was 201.9 MB in the beginning and 247.5 MB in the end (delta: 45.6 MB). Free memory was 157.6 MB in the beginning and 170.5 MB in the end (delta: -12.9 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:16,762 INFO L336 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 280.97 ms. Allocated memory is still 145.2 MB. Free memory was 101.1 MB in the beginning and 91.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.38 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 91.0 MB in the beginning and 180.6 MB in the end (delta: -89.6 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 535.83 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 158.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3850.74 ms. Allocated memory was 201.9 MB in the beginning and 247.5 MB in the end (delta: 45.6 MB). Free memory was 157.6 MB in the beginning and 170.5 MB in the end (delta: -12.9 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (p + 2 * ielen <= bufsize_0 + 2 * i && 1 <= p) && 1 <= leader_len - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.5s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 80 SDtfs, 37 SDslu, 305 SDs, 0 SdLazy, 158 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s 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 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 9578 SizeOfPredicates, 6 NumberOfNonLiveVariables, 82 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 39/44 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...