./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 704f106dd2de438ac750bf027fbdb25552a79f07 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:15:02,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:15:02,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:15:02,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:15:02,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:15:02,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:15:02,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:15:02,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:15:02,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:15:02,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:15:02,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:15:02,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:15:02,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:15:02,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:15:02,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:15:02,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:15:02,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:15:02,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:15:02,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:15:02,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:15:02,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:15:02,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:15:02,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:15:02,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:15:02,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:15:02,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:15:02,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:15:02,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:15:02,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:15:02,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:15:02,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:15:02,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:15:02,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:15:02,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:15:02,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:15:02,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:15:02,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:15:02,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:15:02,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:15:02,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:15:02,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:15:02,457 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:15:02,472 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:15:02,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:15:02,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:15:02,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:15:02,474 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:15:02,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:15:02,475 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:15:02,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:15:02,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:15:02,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:15:02,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:15:02,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:15:02,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:15:02,477 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:15:02,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:15:02,477 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:15:02,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:15:02,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:15:02,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:15:02,478 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:15:02,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:15:02,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:15:02,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:15:02,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:15:02,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:15:02,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:15:02,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:15:02,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:15:02,481 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:15:02,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 704f106dd2de438ac750bf027fbdb25552a79f07 [2020-07-28 18:15:02,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:15:02,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:15:02,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:15:02,874 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:15:02,877 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:15:02,878 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2020-07-28 18:15:02,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e521d8c29/0b6497e69c504ba88494c21e97289351/FLAG676a9adb3 [2020-07-28 18:15:03,359 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:15:03,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2020-07-28 18:15:03,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e521d8c29/0b6497e69c504ba88494c21e97289351/FLAG676a9adb3 [2020-07-28 18:15:03,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e521d8c29/0b6497e69c504ba88494c21e97289351 [2020-07-28 18:15:03,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:15:03,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:15:03,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:15:03,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:15:03,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:15:03,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:15:03" (1/1) ... [2020-07-28 18:15:03,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efd37ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:03, skipping insertion in model container [2020-07-28 18:15:03,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:15:03" (1/1) ... [2020-07-28 18:15:03,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:15:03,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:15:03,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:15:03,962 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:15:03,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:15:04,000 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:15:04,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04 WrapperNode [2020-07-28 18:15:04,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:15:04,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:15:04,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:15:04,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:15:04,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04" (1/1) ... [2020-07-28 18:15:04,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04" (1/1) ... [2020-07-28 18:15:04,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:15:04,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:15:04,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:15:04,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:15:04,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04" (1/1) ... [2020-07-28 18:15:04,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04" (1/1) ... [2020-07-28 18:15:04,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04" (1/1) ... [2020-07-28 18:15:04,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04" (1/1) ... [2020-07-28 18:15:04,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04" (1/1) ... [2020-07-28 18:15:04,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04" (1/1) ... [2020-07-28 18:15:04,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04" (1/1) ... [2020-07-28 18:15:04,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:15:04,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:15:04,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:15:04,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:15:04,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04" (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-28 18:15:04,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:15:04,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:15:04,572 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:15:04,572 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-28 18:15:04,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:15:04 BoogieIcfgContainer [2020-07-28 18:15:04,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:15:04,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:15:04,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:15:04,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:15:04,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:15:03" (1/3) ... [2020-07-28 18:15:04,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4be1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:15:04, skipping insertion in model container [2020-07-28 18:15:04,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:04" (2/3) ... [2020-07-28 18:15:04,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4be1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:15:04, skipping insertion in model container [2020-07-28 18:15:04,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:15:04" (3/3) ... [2020-07-28 18:15:04,596 INFO L109 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2020-07-28 18:15:04,606 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:15:04,614 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-07-28 18:15:04,627 INFO L251 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-07-28 18:15:04,649 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:15:04,650 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:15:04,650 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:15:04,650 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:15:04,650 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:15:04,650 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:15:04,651 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:15:04,651 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:15:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-28 18:15:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 18:15:04,675 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:04,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:04,677 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1314021635, now seen corresponding path program 1 times [2020-07-28 18:15:04,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:04,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596078648] [2020-07-28 18:15:04,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:04,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_~p~0, main_~i~0, main_~leader_len~0, main_~bufsize~0, main_~bufsize_0~0, main_~ielen~0;havoc main_~p~0;havoc main_~i~0;havoc main_~leader_len~0;havoc main_~bufsize~0;havoc main_~bufsize_0~0;havoc main_~ielen~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~leader_len~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~bufsize~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~ielen~0 := main_#t~nondet2;havoc main_#t~nondet2; {25#true} is VALID [2020-07-28 18:15:04,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#true} assume !!(main_~leader_len~0 < 1000000); {25#true} is VALID [2020-07-28 18:15:04,974 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#true} assume !!(main_~bufsize~0 < 1000000); {25#true} is VALID [2020-07-28 18:15:04,974 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#true} assume !!(main_~ielen~0 < 1000000); {25#true} is VALID [2020-07-28 18:15:04,975 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#true} assume main_~leader_len~0 > 0; {27#(<= 1 ULTIMATE.start_main_~leader_len~0)} is VALID [2020-07-28 18:15:04,976 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#(<= 1 ULTIMATE.start_main_~leader_len~0)} assume main_~bufsize~0 > 0; {27#(<= 1 ULTIMATE.start_main_~leader_len~0)} is VALID [2020-07-28 18:15:04,978 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#(<= 1 ULTIMATE.start_main_~leader_len~0)} assume main_~ielen~0 > 0; {27#(<= 1 ULTIMATE.start_main_~leader_len~0)} is VALID [2020-07-28 18:15:04,979 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#(<= 1 ULTIMATE.start_main_~leader_len~0)} assume !(main_~bufsize~0 < main_~leader_len~0);main_~p~0 := 0;main_~bufsize_0~0 := main_~bufsize~0;main_~bufsize~0 := main_~bufsize~0 - main_~leader_len~0;main_~p~0 := main_~p~0 + main_~leader_len~0; {28#(<= 1 ULTIMATE.start_main_~p~0)} is VALID [2020-07-28 18:15:04,980 INFO L280 TraceCheckUtils]: 8: Hoare triple {28#(<= 1 ULTIMATE.start_main_~p~0)} assume !(main_~bufsize~0 < 2 * main_~ielen~0);main_~i~0 := 0; {28#(<= 1 ULTIMATE.start_main_~p~0)} is VALID [2020-07-28 18:15:04,982 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#(<= 1 ULTIMATE.start_main_~p~0)} assume !!(main_~i~0 < main_~ielen~0 && main_~bufsize~0 > 2);__VERIFIER_assert_#in~cond := (if 0 <= main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {29#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:04,984 INFO L280 TraceCheckUtils]: 10: Hoare triple {29#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {26#false} is VALID [2020-07-28 18:15:04,984 INFO L280 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2020-07-28 18:15:04,987 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-28 18:15:04,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596078648] [2020-07-28 18:15:04,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:04,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:15:04,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293939347] [2020-07-28 18:15:04,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 18:15:04,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:05,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:15:05,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:05,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:15:05,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:05,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:15:05,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:15:05,045 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2020-07-28 18:15:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:05,273 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2020-07-28 18:15:05,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:15:05,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 18:15:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2020-07-28 18:15:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2020-07-28 18:15:05,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2020-07-28 18:15:05,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:05,386 INFO L225 Difference]: With dead ends: 43 [2020-07-28 18:15:05,386 INFO L226 Difference]: Without dead ends: 18 [2020-07-28 18:15:05,391 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:15:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-28 18:15:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-28 18:15:05,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:05,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2020-07-28 18:15:05,433 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2020-07-28 18:15:05,433 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2020-07-28 18:15:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:05,436 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-28 18:15:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-28 18:15:05,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:05,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:05,438 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2020-07-28 18:15:05,438 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2020-07-28 18:15:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:05,440 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-28 18:15:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-28 18:15:05,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:05,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:05,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:05,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 18:15:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-28 18:15:05,446 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2020-07-28 18:15:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:05,447 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-28 18:15:05,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:15:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-28 18:15:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 18:15:05,448 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:05,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:05,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:15:05,450 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:05,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:05,450 INFO L82 PathProgramCache]: Analyzing trace with hash 54563046, now seen corresponding path program 1 times [2020-07-28 18:15:05,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:05,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309047590] [2020-07-28 18:15:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:05,550 INFO L280 TraceCheckUtils]: 0: Hoare triple {147#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_~p~0, main_~i~0, main_~leader_len~0, main_~bufsize~0, main_~bufsize_0~0, main_~ielen~0;havoc main_~p~0;havoc main_~i~0;havoc main_~leader_len~0;havoc main_~bufsize~0;havoc main_~bufsize_0~0;havoc main_~ielen~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~leader_len~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~bufsize~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~ielen~0 := main_#t~nondet2;havoc main_#t~nondet2; {147#true} is VALID [2020-07-28 18:15:05,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {147#true} assume !!(main_~leader_len~0 < 1000000); {147#true} is VALID [2020-07-28 18:15:05,551 INFO L280 TraceCheckUtils]: 2: Hoare triple {147#true} assume !!(main_~bufsize~0 < 1000000); {147#true} is VALID [2020-07-28 18:15:05,551 INFO L280 TraceCheckUtils]: 3: Hoare triple {147#true} assume !!(main_~ielen~0 < 1000000); {147#true} is VALID [2020-07-28 18:15:05,552 INFO L280 TraceCheckUtils]: 4: Hoare triple {147#true} assume main_~leader_len~0 > 0; {147#true} is VALID [2020-07-28 18:15:05,552 INFO L280 TraceCheckUtils]: 5: Hoare triple {147#true} assume main_~bufsize~0 > 0; {147#true} is VALID [2020-07-28 18:15:05,553 INFO L280 TraceCheckUtils]: 6: Hoare triple {147#true} assume main_~ielen~0 > 0; {147#true} is VALID [2020-07-28 18:15:05,554 INFO L280 TraceCheckUtils]: 7: Hoare triple {147#true} assume !(main_~bufsize~0 < main_~leader_len~0);main_~p~0 := 0;main_~bufsize_0~0 := main_~bufsize~0;main_~bufsize~0 := main_~bufsize~0 - main_~leader_len~0;main_~p~0 := main_~p~0 + main_~leader_len~0; {149#(<= (+ ULTIMATE.start_main_~bufsize~0 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0)} is VALID [2020-07-28 18:15:05,555 INFO L280 TraceCheckUtils]: 8: Hoare triple {149#(<= (+ ULTIMATE.start_main_~bufsize~0 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0)} assume !(main_~bufsize~0 < 2 * main_~ielen~0);main_~i~0 := 0; {149#(<= (+ ULTIMATE.start_main_~bufsize~0 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0)} is VALID [2020-07-28 18:15:05,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {149#(<= (+ ULTIMATE.start_main_~bufsize~0 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0)} assume !!(main_~i~0 < main_~ielen~0 && main_~bufsize~0 > 2);__VERIFIER_assert_#in~cond := (if 0 <= main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {150#(<= (+ ULTIMATE.start_main_~p~0 3) ULTIMATE.start_main_~bufsize_0~0)} is VALID [2020-07-28 18:15:05,558 INFO L280 TraceCheckUtils]: 10: Hoare triple {150#(<= (+ ULTIMATE.start_main_~p~0 3) ULTIMATE.start_main_~bufsize_0~0)} assume !(0 == __VERIFIER_assert_~cond); {150#(<= (+ ULTIMATE.start_main_~p~0 3) ULTIMATE.start_main_~bufsize_0~0)} is VALID [2020-07-28 18:15:05,559 INFO L280 TraceCheckUtils]: 11: Hoare triple {150#(<= (+ ULTIMATE.start_main_~p~0 3) ULTIMATE.start_main_~bufsize_0~0)} __VERIFIER_assert_#in~cond := (if 1 + main_~p~0 < main_~bufsize_0~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {151#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:05,560 INFO L280 TraceCheckUtils]: 12: Hoare triple {151#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {148#false} is VALID [2020-07-28 18:15:05,561 INFO L280 TraceCheckUtils]: 13: Hoare triple {148#false} assume !false; {148#false} is VALID [2020-07-28 18:15:05,562 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-28 18:15:05,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309047590] [2020-07-28 18:15:05,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:05,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:15:05,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762274128] [2020-07-28 18:15:05,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-28 18:15:05,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:05,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:15:05,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:05,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:15:05,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:05,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:15:05,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:15:05,589 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2020-07-28 18:15:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:05,763 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-28 18:15:05,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:15:05,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-28 18:15:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-07-28 18:15:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-07-28 18:15:05,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2020-07-28 18:15:05,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:05,804 INFO L225 Difference]: With dead ends: 24 [2020-07-28 18:15:05,804 INFO L226 Difference]: Without dead ends: 22 [2020-07-28 18:15:05,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:15:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-28 18:15:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-28 18:15:05,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:05,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-28 18:15:05,826 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-28 18:15:05,826 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-28 18:15:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:05,828 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-28 18:15:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-28 18:15:05,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:05,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:05,829 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-28 18:15:05,830 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-28 18:15:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:05,832 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-28 18:15:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-28 18:15:05,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:05,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:05,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:05,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 18:15:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-07-28 18:15:05,836 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2020-07-28 18:15:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:05,837 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-07-28 18:15:05,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:15:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-28 18:15:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 18:15:05,838 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:05,838 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:05,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:15:05,839 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:05,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1692557492, now seen corresponding path program 1 times [2020-07-28 18:15:05,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:05,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246798849] [2020-07-28 18:15:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:05,990 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_~p~0, main_~i~0, main_~leader_len~0, main_~bufsize~0, main_~bufsize_0~0, main_~ielen~0;havoc main_~p~0;havoc main_~i~0;havoc main_~leader_len~0;havoc main_~bufsize~0;havoc main_~bufsize_0~0;havoc main_~ielen~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~leader_len~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~bufsize~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~ielen~0 := main_#t~nondet2;havoc main_#t~nondet2; {258#true} is VALID [2020-07-28 18:15:05,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#true} assume !!(main_~leader_len~0 < 1000000); {258#true} is VALID [2020-07-28 18:15:05,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {258#true} assume !!(main_~bufsize~0 < 1000000); {258#true} is VALID [2020-07-28 18:15:05,992 INFO L280 TraceCheckUtils]: 3: Hoare triple {258#true} assume !!(main_~ielen~0 < 1000000); {258#true} is VALID [2020-07-28 18:15:05,992 INFO L280 TraceCheckUtils]: 4: Hoare triple {258#true} assume main_~leader_len~0 > 0; {258#true} is VALID [2020-07-28 18:15:05,992 INFO L280 TraceCheckUtils]: 5: Hoare triple {258#true} assume main_~bufsize~0 > 0; {258#true} is VALID [2020-07-28 18:15:05,993 INFO L280 TraceCheckUtils]: 6: Hoare triple {258#true} assume main_~ielen~0 > 0; {258#true} is VALID [2020-07-28 18:15:05,995 INFO L280 TraceCheckUtils]: 7: Hoare triple {258#true} assume !(main_~bufsize~0 < main_~leader_len~0);main_~p~0 := 0;main_~bufsize_0~0 := main_~bufsize~0;main_~bufsize~0 := main_~bufsize~0 - main_~leader_len~0;main_~p~0 := main_~p~0 + main_~leader_len~0; {260#(<= (+ ULTIMATE.start_main_~bufsize~0 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0)} is VALID [2020-07-28 18:15:05,996 INFO L280 TraceCheckUtils]: 8: Hoare triple {260#(<= (+ ULTIMATE.start_main_~bufsize~0 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0)} assume !(main_~bufsize~0 < 2 * main_~ielen~0);main_~i~0 := 0; {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:15:05,997 INFO L280 TraceCheckUtils]: 9: Hoare triple {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~ielen~0 && main_~bufsize~0 > 2);__VERIFIER_assert_#in~cond := (if 0 <= main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:15:05,998 INFO L280 TraceCheckUtils]: 10: Hoare triple {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} assume !(0 == __VERIFIER_assert_~cond); {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:15:05,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} __VERIFIER_assert_#in~cond := (if 1 + main_~p~0 < main_~bufsize_0~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:15:06,000 INFO L280 TraceCheckUtils]: 12: Hoare triple {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} assume !(0 == __VERIFIER_assert_~cond); {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:15:06,001 INFO L280 TraceCheckUtils]: 13: Hoare triple {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} main_~p~0 := 2 + main_~p~0; {262#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0) 2))} is VALID [2020-07-28 18:15:06,003 INFO L280 TraceCheckUtils]: 14: Hoare triple {262#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0) 2))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:15:06,004 INFO L280 TraceCheckUtils]: 15: Hoare triple {261#(<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~ielen~0 && main_~bufsize~0 > 2);__VERIFIER_assert_#in~cond := (if 0 <= main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {263#(<= (+ ULTIMATE.start_main_~p~0 2) ULTIMATE.start_main_~bufsize_0~0)} is VALID [2020-07-28 18:15:06,005 INFO L280 TraceCheckUtils]: 16: Hoare triple {263#(<= (+ ULTIMATE.start_main_~p~0 2) ULTIMATE.start_main_~bufsize_0~0)} assume !(0 == __VERIFIER_assert_~cond); {263#(<= (+ ULTIMATE.start_main_~p~0 2) ULTIMATE.start_main_~bufsize_0~0)} is VALID [2020-07-28 18:15:06,007 INFO L280 TraceCheckUtils]: 17: Hoare triple {263#(<= (+ ULTIMATE.start_main_~p~0 2) ULTIMATE.start_main_~bufsize_0~0)} __VERIFIER_assert_#in~cond := (if 1 + main_~p~0 < main_~bufsize_0~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {264#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:06,008 INFO L280 TraceCheckUtils]: 18: Hoare triple {264#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {259#false} is VALID [2020-07-28 18:15:06,008 INFO L280 TraceCheckUtils]: 19: Hoare triple {259#false} assume !false; {259#false} is VALID [2020-07-28 18:15:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:15:06,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246798849] [2020-07-28 18:15:06,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960159854] [2020-07-28 18:15:06,011 INFO L95 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-28 18:15:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:06,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-28 18:15:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:06,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:15:06,572 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:15:06,727 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_~p~0, main_~i~0, main_~leader_len~0, main_~bufsize~0, main_~bufsize_0~0, main_~ielen~0;havoc main_~p~0;havoc main_~i~0;havoc main_~leader_len~0;havoc main_~bufsize~0;havoc main_~bufsize_0~0;havoc main_~ielen~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~leader_len~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~bufsize~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~ielen~0 := main_#t~nondet2;havoc main_#t~nondet2; {258#true} is VALID [2020-07-28 18:15:06,728 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#true} assume !!(main_~leader_len~0 < 1000000); {258#true} is VALID [2020-07-28 18:15:06,728 INFO L280 TraceCheckUtils]: 2: Hoare triple {258#true} assume !!(main_~bufsize~0 < 1000000); {258#true} is VALID [2020-07-28 18:15:06,729 INFO L280 TraceCheckUtils]: 3: Hoare triple {258#true} assume !!(main_~ielen~0 < 1000000); {258#true} is VALID [2020-07-28 18:15:06,729 INFO L280 TraceCheckUtils]: 4: Hoare triple {258#true} assume main_~leader_len~0 > 0; {258#true} is VALID [2020-07-28 18:15:06,730 INFO L280 TraceCheckUtils]: 5: Hoare triple {258#true} assume main_~bufsize~0 > 0; {258#true} is VALID [2020-07-28 18:15:06,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {258#true} assume main_~ielen~0 > 0; {258#true} is VALID [2020-07-28 18:15:06,731 INFO L280 TraceCheckUtils]: 7: Hoare triple {258#true} assume !(main_~bufsize~0 < main_~leader_len~0);main_~p~0 := 0;main_~bufsize_0~0 := main_~bufsize~0;main_~bufsize~0 := main_~bufsize~0 - main_~leader_len~0;main_~p~0 := main_~p~0 + main_~leader_len~0; {260#(<= (+ ULTIMATE.start_main_~bufsize~0 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0)} is VALID [2020-07-28 18:15:06,733 INFO L280 TraceCheckUtils]: 8: Hoare triple {260#(<= (+ ULTIMATE.start_main_~bufsize~0 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0)} assume !(main_~bufsize~0 < 2 * main_~ielen~0);main_~i~0 := 0; {292#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0))} is VALID [2020-07-28 18:15:06,734 INFO L280 TraceCheckUtils]: 9: Hoare triple {292#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0))} assume !!(main_~i~0 < main_~ielen~0 && main_~bufsize~0 > 2);__VERIFIER_assert_#in~cond := (if 0 <= main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {292#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0))} is VALID [2020-07-28 18:15:06,736 INFO L280 TraceCheckUtils]: 10: Hoare triple {292#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0))} assume !(0 == __VERIFIER_assert_~cond); {292#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0))} is VALID [2020-07-28 18:15:06,737 INFO L280 TraceCheckUtils]: 11: Hoare triple {292#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0))} __VERIFIER_assert_#in~cond := (if 1 + main_~p~0 < main_~bufsize_0~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {292#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0))} is VALID [2020-07-28 18:15:06,738 INFO L280 TraceCheckUtils]: 12: Hoare triple {292#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0))} assume !(0 == __VERIFIER_assert_~cond); {292#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0))} is VALID [2020-07-28 18:15:06,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {292#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0))} main_~p~0 := 2 + main_~p~0; {308#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 2)))} is VALID [2020-07-28 18:15:06,742 INFO L280 TraceCheckUtils]: 14: Hoare triple {308#(and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 2)))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {312#(and (<= 1 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 2)))} is VALID [2020-07-28 18:15:06,743 INFO L280 TraceCheckUtils]: 15: Hoare triple {312#(and (<= 1 ULTIMATE.start_main_~i~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 2)))} assume !!(main_~i~0 < main_~ielen~0 && main_~bufsize~0 > 2);__VERIFIER_assert_#in~cond := (if 0 <= main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {263#(<= (+ ULTIMATE.start_main_~p~0 2) ULTIMATE.start_main_~bufsize_0~0)} is VALID [2020-07-28 18:15:06,744 INFO L280 TraceCheckUtils]: 16: Hoare triple {263#(<= (+ ULTIMATE.start_main_~p~0 2) ULTIMATE.start_main_~bufsize_0~0)} assume !(0 == __VERIFIER_assert_~cond); {263#(<= (+ ULTIMATE.start_main_~p~0 2) ULTIMATE.start_main_~bufsize_0~0)} is VALID [2020-07-28 18:15:06,746 INFO L280 TraceCheckUtils]: 17: Hoare triple {263#(<= (+ ULTIMATE.start_main_~p~0 2) ULTIMATE.start_main_~bufsize_0~0)} __VERIFIER_assert_#in~cond := (if 1 + main_~p~0 < main_~bufsize_0~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {322#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:15:06,747 INFO L280 TraceCheckUtils]: 18: Hoare triple {322#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {259#false} is VALID [2020-07-28 18:15:06,747 INFO L280 TraceCheckUtils]: 19: Hoare triple {259#false} assume !false; {259#false} is VALID [2020-07-28 18:15:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:15:06,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:15:06,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2020-07-28 18:15:06,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863696166] [2020-07-28 18:15:06,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-28 18:15:06,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:06,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-28 18:15:06,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:06,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-28 18:15:06,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:06,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-28 18:15:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-28 18:15:06,799 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2020-07-28 18:15:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:07,430 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-28 18:15:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-28 18:15:07,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-28 18:15:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:15:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2020-07-28 18:15:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:15:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2020-07-28 18:15:07,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 29 transitions. [2020-07-28 18:15:07,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:07,471 INFO L225 Difference]: With dead ends: 28 [2020-07-28 18:15:07,471 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:15:07,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2020-07-28 18:15:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:15:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:15:07,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:07,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:07,473 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:07,473 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:07,473 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:15:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:07,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:07,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:07,474 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:07,475 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:07,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:07,475 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:15:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:07,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:07,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:07,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:07,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:15:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:15:07,476 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2020-07-28 18:15:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:07,476 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:15:07,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-28 18:15:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:07,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:07,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 18:15:07,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:15:07,894 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-28 18:15:07,894 INFO L268 CegarLoopResult]: For program point L27-1(lines 14 45) no Hoare annotation was computed. [2020-07-28 18:15:07,894 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:07,894 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:07,895 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~p~0 2) ULTIMATE.start_main_~bufsize_0~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0))) (<= 1 ULTIMATE.start_main_~leader_len~0) (<= 1 ULTIMATE.start_main_~p~0)) [2020-07-28 18:15:07,895 INFO L268 CegarLoopResult]: For program point L36(lines 36 37) no Hoare annotation was computed. [2020-07-28 18:15:07,895 INFO L268 CegarLoopResult]: For program point L7-3(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:07,896 INFO L264 CegarLoopResult]: At program point L7-5(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~p~0 2) ULTIMATE.start_main_~bufsize_0~0) (<= (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0) (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0))) (<= 1 ULTIMATE.start_main_~leader_len~0) (<= 1 ULTIMATE.start_main_~p~0) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) [2020-07-28 18:15:07,896 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:15:07,896 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:15:07,896 INFO L268 CegarLoopResult]: For program point L28(lines 14 45) no Hoare annotation was computed. [2020-07-28 18:15:07,896 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-28 18:15:07,896 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:07,896 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-28 18:15:07,896 INFO L268 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-07-28 18:15:07,896 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:15:07,897 INFO L268 CegarLoopResult]: For program point L29(lines 14 45) no Hoare annotation was computed. [2020-07-28 18:15:07,897 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-28 18:15:07,897 INFO L268 CegarLoopResult]: For program point L38-2(lines 38 42) no Hoare annotation was computed. [2020-07-28 18:15:07,897 INFO L264 CegarLoopResult]: At program point L38-3(lines 38 42) the Hoare annotation is: (let ((.cse0 (+ (* 2 ULTIMATE.start_main_~ielen~0) ULTIMATE.start_main_~p~0)) (.cse1 (<= 1 ULTIMATE.start_main_~leader_len~0)) (.cse2 (<= 1 ULTIMATE.start_main_~p~0))) (or (and (<= .cse0 (+ ULTIMATE.start_main_~bufsize_0~0 (* 2 ULTIMATE.start_main_~i~0))) .cse1 .cse2 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (<= 0 ULTIMATE.start_main_~i~0) (<= .cse0 ULTIMATE.start_main_~bufsize_0~0) (<= (+ ULTIMATE.start_main_~bufsize~0 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~bufsize_0~0) .cse1 .cse2))) [2020-07-28 18:15:07,898 INFO L268 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2020-07-28 18:15:07,898 INFO L271 CegarLoopResult]: At program point L43(lines 14 45) the Hoare annotation is: true [2020-07-28 18:15:07,902 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:15:07,902 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-28 18:15:07,903 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-28 18:15:07,903 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:15:07,903 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-28 18:15:07,903 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-28 18:15:07,903 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:15:07,904 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 18:15:07,904 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 18:15:07,904 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-28 18:15:07,904 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-28 18:15:07,904 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 18:15:07,904 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 18:15:07,905 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 18:15:07,905 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 18:15:07,905 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 18:15:07,905 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 18:15:07,905 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-28 18:15:07,905 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-28 18:15:07,906 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:15:07,906 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:15:07,906 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:15:07,906 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:15:07,907 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:15:07,907 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 18:15:07,907 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 18:15:07,907 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 18:15:07,907 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2020-07-28 18:15:07,907 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2020-07-28 18:15:07,908 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-28 18:15:07,908 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-28 18:15:07,908 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:15:07,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:15:07 BoogieIcfgContainer [2020-07-28 18:15:07,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:15:07,923 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:15:07,924 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:15:07,924 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:15:07,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:15:04" (3/4) ... [2020-07-28 18:15:07,928 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:15:07,938 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-07-28 18:15:07,938 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:15:07,997 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:15:07,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:15:08,000 INFO L168 Benchmark]: Toolchain (without parser) took 4253.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:08,001 INFO L168 Benchmark]: CDTParser took 0.94 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:15:08,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.90 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:08,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:08,003 INFO L168 Benchmark]: Boogie Preprocessor took 31.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:08,003 INFO L168 Benchmark]: RCFGBuilder took 450.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:08,004 INFO L168 Benchmark]: TraceAbstraction took 3337.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.5 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:08,005 INFO L168 Benchmark]: Witness Printer took 73.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:08,009 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.94 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.90 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 450.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3337.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.5 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. * Witness Printer took 73.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 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 - 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 2 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: (((p + 2 <= bufsize_0 && !(0 == cond)) && 2 * ielen + p <= bufsize_0 + 2 * i) && 1 <= leader_len) && 1 <= p - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: (((p + 2 <= bufsize_0 && 2 * ielen + p <= bufsize_0 + 2 * i) && 1 <= leader_len) && 1 <= p) && 1 <= cond - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((2 * ielen + p <= bufsize_0 + 2 * i && 1 <= leader_len) && 1 <= p) && 1 <= cond) || ((((0 <= i && 2 * ielen + p <= bufsize_0) && bufsize + p <= bufsize_0) && 1 <= leader_len) && 1 <= p) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 50 SDtfs, 56 SDslu, 116 SDs, 0 SdLazy, 104 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 17 NumberOfFragments, 98 HoareAnnotationTreeSize, 4 FomulaSimplifications, 108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 165 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 4708 SizeOfPredicates, 8 NumberOfNonLiveVariables, 60 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 1/8 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...