./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.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-30f4e4a [2019-11-28 00:01:51,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:01:51,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:01:51,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:01:51,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:01:51,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:01:51,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:01:51,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:01:51,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:01:51,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:01:51,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:01:51,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:01:51,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:01:51,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:01:51,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:01:51,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:01:51,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:01:51,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:01:51,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:01:51,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:01:51,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:01:51,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:01:51,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:01:51,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:01:51,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:01:51,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:01:51,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:01:51,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:01:51,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:01:51,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:01:51,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:01:51,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:01:51,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:01:51,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:01:51,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:01:51,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:01:51,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:01:51,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:01:51,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:01:51,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:01:51,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:01:51,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:01:51,477 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:01:51,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:01:51,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:01:51,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:01:51,480 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:01:51,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:01:51,480 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:01:51,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:01:51,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:01:51,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:01:51,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:01:51,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:01:51,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:01:51,483 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:01:51,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:01:51,484 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:01:51,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:01:51,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:01:51,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:01:51,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:01:51,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:01:51,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:01:51,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:01:51,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:01:51,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:01:51,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:01:51,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:01:51,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:01:51,488 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 -> 751def0588f132c393a8666a5acb62e8205c40a1 [2019-11-28 00:01:51,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:01:51,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:01:51,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:01:51,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:01:51,827 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:01:51,828 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2019-11-28 00:01:51,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0728e6d77/c3d1df26603242ab9de82d9db64c978f/FLAGa797bc4d4 [2019-11-28 00:01:52,323 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:01:52,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2019-11-28 00:01:52,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0728e6d77/c3d1df26603242ab9de82d9db64c978f/FLAGa797bc4d4 [2019-11-28 00:01:52,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0728e6d77/c3d1df26603242ab9de82d9db64c978f [2019-11-28 00:01:52,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:01:52,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:01:52,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:01:52,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:01:52,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:01:52,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:01:52" (1/1) ... [2019-11-28 00:01:52,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf4c1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:52, skipping insertion in model container [2019-11-28 00:01:52,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:01:52" (1/1) ... [2019-11-28 00:01:52,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:01:52,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:01:52,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:01:52,981 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:01:53,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:01:53,021 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:01:53,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53 WrapperNode [2019-11-28 00:01:53,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:01:53,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:01:53,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:01:53,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:01:53,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53" (1/1) ... [2019-11-28 00:01:53,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53" (1/1) ... [2019-11-28 00:01:53,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:01:53,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:01:53,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:01:53,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:01:53,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53" (1/1) ... [2019-11-28 00:01:53,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53" (1/1) ... [2019-11-28 00:01:53,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53" (1/1) ... [2019-11-28 00:01:53,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53" (1/1) ... [2019-11-28 00:01:53,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53" (1/1) ... [2019-11-28 00:01:53,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53" (1/1) ... [2019-11-28 00:01:53,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53" (1/1) ... [2019-11-28 00:01:53,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:01:53,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:01:53,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:01:53,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:01:53,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53" (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-11-28 00:01:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:01:53,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:01:53,554 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:01:53,554 INFO L297 CfgBuilder]: Removed 38 assume(true) statements. [2019-11-28 00:01:53,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:53 BoogieIcfgContainer [2019-11-28 00:01:53,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:01:53,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:01:53,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:01:53,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:01:53,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:01:52" (1/3) ... [2019-11-28 00:01:53,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72173776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:01:53, skipping insertion in model container [2019-11-28 00:01:53,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:53" (2/3) ... [2019-11-28 00:01:53,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72173776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:01:53, skipping insertion in model container [2019-11-28 00:01:53,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:53" (3/3) ... [2019-11-28 00:01:53,564 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2019-11-28 00:01:53,573 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:01:53,580 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-28 00:01:53,592 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-28 00:01:53,615 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:01:53,615 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:01:53,615 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:01:53,616 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:01:53,616 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:01:53,616 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:01:53,616 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:01:53,616 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:01:53,634 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2019-11-28 00:01:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 00:01:53,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:53,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:53,641 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:53,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:53,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1479268755, now seen corresponding path program 1 times [2019-11-28 00:01:53,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:53,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967718141] [2019-11-28 00:01:53,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:53,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967718141] [2019-11-28 00:01:53,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:53,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:01:53,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279244771] [2019-11-28 00:01:53,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:01:53,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:53,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:01:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:01:53,821 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2019-11-28 00:01:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:53,968 INFO L93 Difference]: Finished difference Result 154 states and 201 transitions. [2019-11-28 00:01:53,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:01:53,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 00:01:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:53,980 INFO L225 Difference]: With dead ends: 154 [2019-11-28 00:01:53,981 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 00:01:53,985 INFO L630 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-11-28 00:01:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 00:01:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-11-28 00:01:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 00:01:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-11-28 00:01:54,024 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 7 [2019-11-28 00:01:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:54,024 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-11-28 00:01:54,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:01:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-11-28 00:01:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 00:01:54,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:54,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:54,027 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:54,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1391586898, now seen corresponding path program 1 times [2019-11-28 00:01:54,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:54,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930675505] [2019-11-28 00:01:54,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:54,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930675505] [2019-11-28 00:01:54,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:54,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:01:54,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433868495] [2019-11-28 00:01:54,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:01:54,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:54,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:01:54,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:01:54,071 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 4 states. [2019-11-28 00:01:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:54,229 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-11-28 00:01:54,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:01:54,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 00:01:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:54,232 INFO L225 Difference]: With dead ends: 76 [2019-11-28 00:01:54,232 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 00:01:54,233 INFO L630 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-11-28 00:01:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 00:01:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2019-11-28 00:01:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 00:01:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2019-11-28 00:01:54,244 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 8 [2019-11-28 00:01:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:54,244 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2019-11-28 00:01:54,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:01:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2019-11-28 00:01:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:01:54,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:54,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:54,245 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:54,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash 57057392, now seen corresponding path program 1 times [2019-11-28 00:01:54,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:54,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132966422] [2019-11-28 00:01:54,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:54,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132966422] [2019-11-28 00:01:54,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:54,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:01:54,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046599360] [2019-11-28 00:01:54,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:01:54,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:54,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:01:54,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:01:54,287 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 4 states. [2019-11-28 00:01:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:54,420 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-11-28 00:01:54,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:01:54,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 00:01:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:54,422 INFO L225 Difference]: With dead ends: 69 [2019-11-28 00:01:54,422 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 00:01:54,423 INFO L630 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-11-28 00:01:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 00:01:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-11-28 00:01:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 00:01:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-28 00:01:54,432 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 9 [2019-11-28 00:01:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:54,433 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-28 00:01:54,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:01:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-28 00:01:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:01:54,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:54,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:54,438 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:54,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1711132744, now seen corresponding path program 1 times [2019-11-28 00:01:54,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:54,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955850665] [2019-11-28 00:01:54,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:54,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955850665] [2019-11-28 00:01:54,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:54,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:01:54,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169287835] [2019-11-28 00:01:54,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:01:54,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:01:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:54,542 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2019-11-28 00:01:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:54,678 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-11-28 00:01:54,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:01:54,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 00:01:54,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:54,680 INFO L225 Difference]: With dead ends: 61 [2019-11-28 00:01:54,680 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 00:01:54,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:01:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 00:01:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-11-28 00:01:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 00:01:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-28 00:01:54,700 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2019-11-28 00:01:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:54,700 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-28 00:01:54,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:01:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-28 00:01:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 00:01:54,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:54,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:54,702 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash 574068571, now seen corresponding path program 1 times [2019-11-28 00:01:54,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:54,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103660286] [2019-11-28 00:01:54,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:54,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103660286] [2019-11-28 00:01:54,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:54,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:01:54,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506029161] [2019-11-28 00:01:54,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:01:54,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:54,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:01:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:01:54,778 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2019-11-28 00:01:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:54,895 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 00:01:54,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:01:54,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 00:01:54,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:54,897 INFO L225 Difference]: With dead ends: 58 [2019-11-28 00:01:54,897 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 00:01:54,898 INFO L630 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-11-28 00:01:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 00:01:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-28 00:01:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 00:01:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 00:01:54,906 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2019-11-28 00:01:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:54,906 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 00:01:54,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:01:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 00:01:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 00:01:54,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:54,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:54,909 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:54,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:54,909 INFO L82 PathProgramCache]: Analyzing trace with hash -470786895, now seen corresponding path program 1 times [2019-11-28 00:01:54,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:54,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655135561] [2019-11-28 00:01:54,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:54,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655135561] [2019-11-28 00:01:54,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:54,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:01:54,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471736583] [2019-11-28 00:01:54,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:01:54,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:54,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:01:54,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:01:54,981 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2019-11-28 00:01:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:55,091 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 00:01:55,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:01:55,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-28 00:01:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:55,094 INFO L225 Difference]: With dead ends: 58 [2019-11-28 00:01:55,095 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 00:01:55,097 INFO L630 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-11-28 00:01:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 00:01:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-11-28 00:01:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 00:01:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-28 00:01:55,107 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2019-11-28 00:01:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:55,108 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-28 00:01:55,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:01:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-28 00:01:55,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:01:55,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:55,111 INFO L410 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-11-28 00:01:55,111 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:55,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1892453097, now seen corresponding path program 1 times [2019-11-28 00:01:55,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:55,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236811250] [2019-11-28 00:01:55,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:55,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236811250] [2019-11-28 00:01:55,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:55,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:01:55,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944006785] [2019-11-28 00:01:55,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:01:55,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:55,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:01:55,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:01:55,236 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2019-11-28 00:01:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:55,375 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-11-28 00:01:55,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:01:55,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 00:01:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:55,377 INFO L225 Difference]: With dead ends: 49 [2019-11-28 00:01:55,377 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:01:55,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:01:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:01:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:01:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:01:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:01:55,379 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-28 00:01:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:55,379 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:01:55,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:01:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:01:55,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:01:55,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:01:55,888 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,889 INFO L249 CegarLoopResult]: At program point L52(lines 10 53) the Hoare annotation is: true [2019-11-28 00:01:55,889 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,889 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:01:55,889 INFO L242 CegarLoopResult]: At program point L20-2(lines 20 51) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-28 00:01:55,889 INFO L246 CegarLoopResult]: For program point L20-3(lines 20 51) no Hoare annotation was computed. [2019-11-28 00:01:55,889 INFO L246 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,890 INFO L242 CegarLoopResult]: 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) (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-11-28 00:01:55,890 INFO L246 CegarLoopResult]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,890 INFO L242 CegarLoopResult]: 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) (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-11-28 00:01:55,890 INFO L246 CegarLoopResult]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,891 INFO L242 CegarLoopResult]: 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) (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-11-28 00:01:55,891 INFO L246 CegarLoopResult]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,891 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,892 INFO L242 CegarLoopResult]: 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) (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-11-28 00:01:55,892 INFO L246 CegarLoopResult]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,892 INFO L242 CegarLoopResult]: 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) (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-11-28 00:01:55,892 INFO L246 CegarLoopResult]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,893 INFO L242 CegarLoopResult]: 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) (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-11-28 00:01:55,893 INFO L242 CegarLoopResult]: At program point L21-2(lines 21 50) the Hoare annotation is: (and (or (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)) (<= 0 ULTIMATE.start_main_~j~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-28 00:01:55,893 INFO L246 CegarLoopResult]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,893 INFO L242 CegarLoopResult]: 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-11-28 00:01:55,893 INFO L246 CegarLoopResult]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,893 INFO L242 CegarLoopResult]: At program point L4-23(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-11-28 00:01:55,894 INFO L246 CegarLoopResult]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,894 INFO L242 CegarLoopResult]: 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-11-28 00:01:55,894 INFO L246 CegarLoopResult]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,894 INFO L242 CegarLoopResult]: At program point L4-29(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-11-28 00:01:55,894 INFO L246 CegarLoopResult]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,895 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,895 INFO L246 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,895 INFO L242 CegarLoopResult]: 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-11-28 00:01:55,895 INFO L246 CegarLoopResult]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,896 INFO L246 CegarLoopResult]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,896 INFO L246 CegarLoopResult]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,896 INFO L246 CegarLoopResult]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,896 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,896 INFO L242 CegarLoopResult]: At program point L4-35(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-11-28 00:01:55,897 INFO L246 CegarLoopResult]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,897 INFO L246 CegarLoopResult]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,897 INFO L246 CegarLoopResult]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,897 INFO L246 CegarLoopResult]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,898 INFO L242 CegarLoopResult]: At program point L4-38(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-28 00:01:55,898 INFO L246 CegarLoopResult]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,898 INFO L246 CegarLoopResult]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,898 INFO L246 CegarLoopResult]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,898 INFO L246 CegarLoopResult]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,899 INFO L242 CegarLoopResult]: At program point L4-41(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-28 00:01:55,899 INFO L246 CegarLoopResult]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,899 INFO L246 CegarLoopResult]: For program point L4-42(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,899 INFO L246 CegarLoopResult]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,899 INFO L246 CegarLoopResult]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,900 INFO L242 CegarLoopResult]: At program point L4-44(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-28 00:01:55,900 INFO L246 CegarLoopResult]: For program point L5-14(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,900 INFO L246 CegarLoopResult]: For program point L4-45(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:01:55,900 INFO L246 CegarLoopResult]: For program point L22(lines 22 49) no Hoare annotation was computed. [2019-11-28 00:01:55,900 INFO L246 CegarLoopResult]: For program point L5-15(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,900 INFO L242 CegarLoopResult]: At program point L4-47(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-28 00:01:55,900 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,901 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:01:55,901 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,901 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-28 00:01:55,901 INFO L242 CegarLoopResult]: 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) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-28 00:01:55,901 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,901 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,902 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,902 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,902 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:01:55,902 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,903 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,903 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,903 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,903 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,903 INFO L246 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-28 00:01:55,904 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:01:55,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:01:55 BoogieIcfgContainer [2019-11-28 00:01:55,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:01:55,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:01:55,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:01:55,933 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:01:55,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:53" (3/4) ... [2019-11-28 00:01:55,937 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:01:55,951 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-28 00:01:55,952 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:01:56,032 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:01:56,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:01:56,035 INFO L168 Benchmark]: Toolchain (without parser) took 3282.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 960.4 MB in the beginning and 868.7 MB in the end (delta: 91.6 MB). Peak memory consumption was 221.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:56,035 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:01:56,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.15 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:56,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:56,037 INFO L168 Benchmark]: Boogie Preprocessor took 23.50 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:56,038 INFO L168 Benchmark]: RCFGBuilder took 416.86 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:56,038 INFO L168 Benchmark]: TraceAbstraction took 2375.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 868.7 MB in the end (delta: 224.4 MB). Peak memory consumption was 224.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:01:56,039 INFO L168 Benchmark]: Witness Printer took 100.06 ms. Allocated memory is still 1.2 GB. Free memory is still 868.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:01:56,042 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.15 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 92.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.50 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 416.86 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2375.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 868.7 MB in the end (delta: 224.4 MB). Peak memory consumption was 224.4 MB. Max. memory is 11.5 GB. * Witness Printer took 100.06 ms. Allocated memory is still 1.2 GB. Free memory is still 868.7 MB. There was no memory consumed. 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 && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && 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: 20]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((!(0 == cond) || i + 1 <= len) && 0 <= j) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((j + 5 <= bufsize && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - 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 && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && 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 && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 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. Result: SAFE, OverallTime: 1.7s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 345 SDtfs, 310 SDslu, 149 SDs, 0 SdLazy, 338 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s 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 DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 46 NumberOfFragments, 430 HoareAnnotationTreeSize, 20 FomulaSimplifications, 4064 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 98 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 5168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...