./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.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 751def0588f132c393a8666a5acb62e8205c40a1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 17:30:45,749 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 17:30:45,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 17:30:45,767 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 17:30:45,768 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 17:30:45,769 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 17:30:45,770 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 17:30:45,779 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 17:30:45,781 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 17:30:45,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 17:30:45,782 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 17:30:45,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 17:30:45,783 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 17:30:45,784 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 17:30:45,786 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 17:30:45,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 17:30:45,788 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 17:30:45,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 17:30:45,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 17:30:45,793 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 17:30:45,794 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 17:30:45,795 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 17:30:45,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 17:30:45,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 17:30:45,798 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 17:30:45,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 17:30:45,800 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 17:30:45,801 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 17:30:45,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 17:30:45,803 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 17:30:45,803 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 17:30:45,804 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 17:30:45,804 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 17:30:45,804 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 17:30:45,805 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 17:30:45,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 17:30:45,806 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 17:30:45,834 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 17:30:45,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 17:30:45,836 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 17:30:45,836 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 17:30:45,836 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 17:30:45,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 17:30:45,838 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 17:30:45,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 17:30:45,838 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 17:30:45,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 17:30:45,838 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 17:30:45,838 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 17:30:45,839 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 17:30:45,839 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 17:30:45,839 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 17:30:45,839 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 17:30:45,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 17:30:45,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 17:30:45,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 17:30:45,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 17:30:45,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 17:30:45,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 17:30:45,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 17:30:45,840 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 17:30:45,841 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 17:30:45,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 17:30:45,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 17:30:45,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 751def0588f132c393a8666a5acb62e8205c40a1 [2019-01-14 17:30:45,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 17:30:45,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 17:30:45,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 17:30:45,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 17:30:45,892 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 17:30:45,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2019-01-14 17:30:45,951 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aee4cea7/d46c86e18260455cb1542dcbcc859fa1/FLAG9fb64a8dc [2019-01-14 17:30:46,321 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 17:30:46,322 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2019-01-14 17:30:46,327 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aee4cea7/d46c86e18260455cb1542dcbcc859fa1/FLAG9fb64a8dc [2019-01-14 17:30:46,703 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aee4cea7/d46c86e18260455cb1542dcbcc859fa1 [2019-01-14 17:30:46,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 17:30:46,708 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 17:30:46,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 17:30:46,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 17:30:46,714 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 17:30:46,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:30:46" (1/1) ... [2019-01-14 17:30:46,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72da797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:46, skipping insertion in model container [2019-01-14 17:30:46,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:30:46" (1/1) ... [2019-01-14 17:30:46,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 17:30:46,743 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 17:30:46,944 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:30:46,953 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 17:30:46,982 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:30:47,000 INFO L195 MainTranslator]: Completed translation [2019-01-14 17:30:47,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47 WrapperNode [2019-01-14 17:30:47,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 17:30:47,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 17:30:47,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 17:30:47,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 17:30:47,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47" (1/1) ... [2019-01-14 17:30:47,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47" (1/1) ... [2019-01-14 17:30:47,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 17:30:47,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 17:30:47,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 17:30:47,041 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 17:30:47,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47" (1/1) ... [2019-01-14 17:30:47,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47" (1/1) ... [2019-01-14 17:30:47,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47" (1/1) ... [2019-01-14 17:30:47,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47" (1/1) ... [2019-01-14 17:30:47,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47" (1/1) ... [2019-01-14 17:30:47,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47" (1/1) ... [2019-01-14 17:30:47,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47" (1/1) ... [2019-01-14 17:30:47,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 17:30:47,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 17:30:47,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 17:30:47,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 17:30:47,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47" (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 [2019-01-14 17:30:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 17:30:47,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 17:30:47,716 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 17:30:47,716 INFO L286 CfgBuilder]: Removed 38 assue(true) statements. [2019-01-14 17:30:47,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:30:47 BoogieIcfgContainer [2019-01-14 17:30:47,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 17:30:47,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 17:30:47,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 17:30:47,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 17:30:47,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 05:30:46" (1/3) ... [2019-01-14 17:30:47,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a76b2e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:30:47, skipping insertion in model container [2019-01-14 17:30:47,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:30:47" (2/3) ... [2019-01-14 17:30:47,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a76b2e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:30:47, skipping insertion in model container [2019-01-14 17:30:47,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:30:47" (3/3) ... [2019-01-14 17:30:47,724 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call_false-termination.i [2019-01-14 17:30:47,734 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 17:30:47,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-01-14 17:30:47,759 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-01-14 17:30:47,786 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 17:30:47,787 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 17:30:47,787 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 17:30:47,787 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 17:30:47,787 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 17:30:47,788 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 17:30:47,788 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 17:30:47,788 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 17:30:47,788 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 17:30:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2019-01-14 17:30:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 17:30:47,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:30:47,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:30:47,812 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:30:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:30:47,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1479268755, now seen corresponding path program 1 times [2019-01-14 17:30:47,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:30:47,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:30:47,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:47,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:30:47,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:30:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:30:47,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:30:47,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:30:47,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:30:47,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:30:47,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:30:47,984 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2019-01-14 17:30:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:30:48,347 INFO L93 Difference]: Finished difference Result 146 states and 189 transitions. [2019-01-14 17:30:48,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:30:48,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-14 17:30:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:30:48,359 INFO L225 Difference]: With dead ends: 146 [2019-01-14 17:30:48,359 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 17:30:48,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:30:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 17:30:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-14 17:30:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 17:30:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-01-14 17:30:48,396 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 7 [2019-01-14 17:30:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:30:48,397 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-01-14 17:30:48,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:30:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-01-14 17:30:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 17:30:48,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:30:48,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:30:48,399 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:30:48,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:30:48,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1391586898, now seen corresponding path program 1 times [2019-01-14 17:30:48,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:30:48,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:30:48,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:48,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:30:48,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:30:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:30:48,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:30:48,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:30:48,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:30:48,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:30:48,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:30:48,452 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 4 states. [2019-01-14 17:30:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:30:48,775 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-01-14 17:30:48,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:30:48,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-14 17:30:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:30:48,777 INFO L225 Difference]: With dead ends: 71 [2019-01-14 17:30:48,778 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 17:30:48,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:30:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 17:30:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-01-14 17:30:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 17:30:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2019-01-14 17:30:48,790 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 8 [2019-01-14 17:30:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:30:48,790 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2019-01-14 17:30:48,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:30:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2019-01-14 17:30:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 17:30:48,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:30:48,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:30:48,793 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:30:48,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:30:48,793 INFO L82 PathProgramCache]: Analyzing trace with hash 57057392, now seen corresponding path program 1 times [2019-01-14 17:30:48,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:30:48,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:30:48,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:48,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:30:48,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:30:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:30:48,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:30:48,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:30:48,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:30:48,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:30:48,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:30:48,886 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 5 states. [2019-01-14 17:30:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:30:49,387 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-01-14 17:30:49,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:30:49,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 17:30:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:30:49,391 INFO L225 Difference]: With dead ends: 70 [2019-01-14 17:30:49,391 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 17:30:49,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:30:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 17:30:49,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2019-01-14 17:30:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 17:30:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-01-14 17:30:49,401 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 9 [2019-01-14 17:30:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:30:49,402 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-01-14 17:30:49,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:30:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-01-14 17:30:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 17:30:49,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:30:49,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:30:49,404 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:30:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:30:49,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1711132744, now seen corresponding path program 1 times [2019-01-14 17:30:49,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:30:49,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:30:49,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:49,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:30:49,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:30:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:30:49,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:30:49,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 17:30:49,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 17:30:49,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 17:30:49,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:30:49,569 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 8 states. [2019-01-14 17:30:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:30:50,024 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-01-14 17:30:50,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 17:30:50,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-01-14 17:30:50,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:30:50,025 INFO L225 Difference]: With dead ends: 64 [2019-01-14 17:30:50,025 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 17:30:50,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-14 17:30:50,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 17:30:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-01-14 17:30:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 17:30:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-01-14 17:30:50,037 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2019-01-14 17:30:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:30:50,038 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-01-14 17:30:50,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 17:30:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-01-14 17:30:50,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 17:30:50,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:30:50,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:30:50,039 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:30:50,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:30:50,039 INFO L82 PathProgramCache]: Analyzing trace with hash 574068571, now seen corresponding path program 1 times [2019-01-14 17:30:50,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:30:50,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:30:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:50,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:30:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:30:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:30:50,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:30:50,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:30:50,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:30:50,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:30:50,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:30:50,123 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 6 states. [2019-01-14 17:30:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:30:50,399 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-01-14 17:30:50,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 17:30:50,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-14 17:30:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:30:50,402 INFO L225 Difference]: With dead ends: 61 [2019-01-14 17:30:50,402 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 17:30:50,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:30:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 17:30:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2019-01-14 17:30:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 17:30:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-14 17:30:50,413 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2019-01-14 17:30:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:30:50,413 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-14 17:30:50,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:30:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-14 17:30:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 17:30:50,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:30:50,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:30:50,417 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:30:50,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:30:50,417 INFO L82 PathProgramCache]: Analyzing trace with hash -470786895, now seen corresponding path program 1 times [2019-01-14 17:30:50,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:30:50,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:30:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:50,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:30:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:30:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:30:50,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:30:50,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 17:30:50,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 17:30:50,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 17:30:50,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:30:50,528 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2019-01-14 17:30:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:30:50,876 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-14 17:30:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:30:50,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-01-14 17:30:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:30:50,879 INFO L225 Difference]: With dead ends: 58 [2019-01-14 17:30:50,880 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 17:30:50,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-14 17:30:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 17:30:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-01-14 17:30:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 17:30:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-01-14 17:30:50,888 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2019-01-14 17:30:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:30:50,889 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-01-14 17:30:50,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 17:30:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-01-14 17:30:50,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 17:30:50,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:30:50,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:30:50,891 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:30:50,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:30:50,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1892453097, now seen corresponding path program 1 times [2019-01-14 17:30:50,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:30:50,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:30:50,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:50,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:30:50,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:30:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:30:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:30:51,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:30:51,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 17:30:51,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 17:30:51,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 17:30:51,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:30:51,020 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 8 states. [2019-01-14 17:30:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:30:51,325 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-01-14 17:30:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 17:30:51,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-01-14 17:30:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:30:51,327 INFO L225 Difference]: With dead ends: 50 [2019-01-14 17:30:51,327 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 17:30:51,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-14 17:30:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 17:30:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 17:30:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 17:30:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 17:30:51,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-01-14 17:30:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:30:51,330 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 17:30:51,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 17:30:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 17:30:51,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 17:30:51,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 17:30:51,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:30:51,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:30:51,628 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 17:30:51,882 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-14 17:30:52,434 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-01-14 17:30:52,447 INFO L451 ceAbstractionStarter]: At program point L52(lines 10 53) the Hoare annotation is: true [2019-01-14 17:30:52,448 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 17:30:52,448 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,448 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 51) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,448 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 20 51) no Hoare annotation was computed. [2019-01-14 17:30:52,448 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,449 INFO L444 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,449 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,449 INFO L448 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,449 INFO L444 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,449 INFO L448 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,449 INFO L444 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,450 INFO L448 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,464 INFO L444 ceAbstractionStarter]: At program point L4-11(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,464 INFO L448 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,465 INFO L444 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,466 INFO L448 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,466 INFO L444 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,466 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 50) the Hoare annotation is: (and (let ((.cse0 (<= 0 ULTIMATE.start_main_~j~0))) (or (and (= ULTIMATE.start___VERIFIER_assert_~cond 1) .cse0) (and .cse0 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)))) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,466 INFO L448 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,466 INFO L444 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,466 INFO L448 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,469 INFO L444 ceAbstractionStarter]: At program point L4-23(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,469 INFO L448 ceAbstractionStarter]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,469 INFO L444 ceAbstractionStarter]: At program point L4-26(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,469 INFO L448 ceAbstractionStarter]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,469 INFO L444 ceAbstractionStarter]: At program point L4-29(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,469 INFO L448 ceAbstractionStarter]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,469 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,470 INFO L448 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,472 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,472 INFO L444 ceAbstractionStarter]: At program point L4-32(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,472 INFO L448 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,472 INFO L448 ceAbstractionStarter]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,472 INFO L448 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,472 INFO L448 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,473 INFO L444 ceAbstractionStarter]: At program point L4-35(lines 3 8) the Hoare annotation is: (and (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,473 INFO L448 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,473 INFO L448 ceAbstractionStarter]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,473 INFO L448 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,473 INFO L448 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,473 INFO L444 ceAbstractionStarter]: At program point L4-38(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,473 INFO L448 ceAbstractionStarter]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,473 INFO L448 ceAbstractionStarter]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,473 INFO L448 ceAbstractionStarter]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,474 INFO L448 ceAbstractionStarter]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,474 INFO L444 ceAbstractionStarter]: At program point L4-41(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,474 INFO L448 ceAbstractionStarter]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,474 INFO L448 ceAbstractionStarter]: For program point L4-42(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,474 INFO L448 ceAbstractionStarter]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,474 INFO L448 ceAbstractionStarter]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,474 INFO L444 ceAbstractionStarter]: At program point L4-44(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,474 INFO L448 ceAbstractionStarter]: For program point L5-14(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,475 INFO L448 ceAbstractionStarter]: For program point L4-45(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:30:52,479 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2019-01-14 17:30:52,479 INFO L448 ceAbstractionStarter]: For program point L5-15(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,480 INFO L444 ceAbstractionStarter]: At program point L4-47(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,480 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,480 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,480 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,480 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 17:30:52,480 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-14 17:30:52,480 INFO L444 ceAbstractionStarter]: At program point L42(lines 22 49) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-01-14 17:30:52,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,483 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,483 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,483 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 17:30:52,483 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,483 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,483 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,484 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,485 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,485 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-01-14 17:30:52,485 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,485 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:30:52,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 05:30:52 BoogieIcfgContainer [2019-01-14 17:30:52,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 17:30:52,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 17:30:52,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 17:30:52,511 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 17:30:52,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:30:47" (3/4) ... [2019-01-14 17:30:52,517 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 17:30:52,531 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-01-14 17:30:52,531 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 17:30:52,662 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 17:30:52,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 17:30:52,663 INFO L168 Benchmark]: Toolchain (without parser) took 5955.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 943.3 MB in the beginning and 1.2 GB in the end (delta: -246.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:30:52,664 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:30:52,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.78 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:30:52,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.87 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:30:52,665 INFO L168 Benchmark]: Boogie Preprocessor took 24.24 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 17:30:52,666 INFO L168 Benchmark]: RCFGBuilder took 652.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 17:30:52,666 INFO L168 Benchmark]: TraceAbstraction took 4792.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.2 MB). Peak memory consumption was 298.2 MB. Max. memory is 11.5 GB. [2019-01-14 17:30:52,668 INFO L168 Benchmark]: Witness Printer took 150.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-01-14 17:30:52,672 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.78 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 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 38.87 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.24 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 652.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4792.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.2 MB). Peak memory consumption was 298.2 MB. Max. memory is 11.5 GB. * Witness Printer took 150.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && cond == 1) && 0 <= j) && i + 1 <= len) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && cond == 1) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && cond == 1) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: limit + 4 <= bufsize && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && cond == 1) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((cond == 1 && 0 <= j) || (0 <= j && i + 1 <= len)) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && cond == 1) && 0 <= j) && i + 1 <= len) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && cond == 1) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((j + 5 <= bufsize && 0 <= j) && i + 1 <= len) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && cond == 1) && 0 <= j) && i + 1 <= len) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && cond == 1) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cond == 1 && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && cond == 1) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && cond == 1) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && cond == 1) && 0 <= j) && i + 1 <= len) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && cond == 1) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 16 error locations. SAFE Result, 4.7s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 270 SDtfs, 389 SDslu, 225 SDs, 0 SdLazy, 652 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 46 NumberOfFragments, 422 HoareAnnotationTreeSize, 20 FomulaSimplifications, 7249 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 312 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 6609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...