./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.p+sep-reducer.c --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/apache-get-tag_true-unreach-call.i.p+sep-reducer.c -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 b38413ca0cda685b7a25d67b5b16f20b69a9d320 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-12 11:23:12,542 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:23:12,544 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:23:12,556 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:23:12,556 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:23:12,557 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:23:12,559 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:23:12,561 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:23:12,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:23:12,564 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:23:12,565 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:23:12,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:23:12,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:23:12,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:23:12,569 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:23:12,570 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:23:12,571 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:23:12,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:23:12,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:23:12,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:23:12,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:23:12,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:23:12,584 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:23:12,584 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:23:12,584 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:23:12,585 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:23:12,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:23:12,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:23:12,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:23:12,590 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:23:12,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:23:12,592 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:23:12,592 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:23:12,592 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:23:12,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:23:12,595 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:23:12,595 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:23:12,634 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:23:12,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:23:12,635 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:23:12,636 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:23:12,637 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:23:12,637 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:23:12,638 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:23:12,638 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:23:12,638 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:23:12,638 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:23:12,638 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:23:12,638 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:23:12,639 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:23:12,640 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:23:12,640 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:23:12,641 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:23:12,641 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:23:12,641 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:23:12,641 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:23:12,641 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:23:12,641 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:23:12,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:23:12,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:23:12,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:23:12,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:23:12,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:23:12,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:23:12,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:23:12,646 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 -> b38413ca0cda685b7a25d67b5b16f20b69a9d320 [2019-01-12 11:23:12,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:23:12,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:23:12,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:23:12,728 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:23:12,728 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:23:12,729 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.p+sep-reducer.c [2019-01-12 11:23:12,789 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a74e4ea/a330b00c0ff64e999a013733279ee735/FLAG696835911 [2019-01-12 11:23:13,404 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:23:13,406 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.p+sep-reducer.c [2019-01-12 11:23:13,434 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a74e4ea/a330b00c0ff64e999a013733279ee735/FLAG696835911 [2019-01-12 11:23:13,567 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a74e4ea/a330b00c0ff64e999a013733279ee735 [2019-01-12 11:23:13,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:23:13,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:23:13,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:23:13,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:23:13,578 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:23:13,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:23:13" (1/1) ... [2019-01-12 11:23:13,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53307116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:13, skipping insertion in model container [2019-01-12 11:23:13,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:23:13" (1/1) ... [2019-01-12 11:23:13,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:23:13,731 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:23:14,506 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:23:14,513 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:23:14,883 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:23:15,036 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:23:15,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15 WrapperNode [2019-01-12 11:23:15,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:23:15,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:23:15,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:23:15,041 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:23:15,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15" (1/1) ... [2019-01-12 11:23:15,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15" (1/1) ... [2019-01-12 11:23:15,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:23:15,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:23:15,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:23:15,245 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:23:15,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15" (1/1) ... [2019-01-12 11:23:15,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15" (1/1) ... [2019-01-12 11:23:15,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15" (1/1) ... [2019-01-12 11:23:15,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15" (1/1) ... [2019-01-12 11:23:15,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15" (1/1) ... [2019-01-12 11:23:15,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15" (1/1) ... [2019-01-12 11:23:15,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15" (1/1) ... [2019-01-12 11:23:15,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:23:15,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:23:15,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:23:15,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:23:15,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15" (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-12 11:23:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:23:15,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:23:19,228 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:23:19,228 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 11:23:19,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:23:19 BoogieIcfgContainer [2019-01-12 11:23:19,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:23:19,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:23:19,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:23:19,235 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:23:19,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:23:13" (1/3) ... [2019-01-12 11:23:19,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799152d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:23:19, skipping insertion in model container [2019-01-12 11:23:19,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:15" (2/3) ... [2019-01-12 11:23:19,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799152d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:23:19, skipping insertion in model container [2019-01-12 11:23:19,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:23:19" (3/3) ... [2019-01-12 11:23:19,239 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+sep-reducer.c [2019-01-12 11:23:19,251 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:23:19,261 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-01-12 11:23:19,279 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-01-12 11:23:19,357 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:23:19,358 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:23:19,358 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:23:19,358 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:23:19,358 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:23:19,358 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:23:19,358 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:23:19,358 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:23:19,358 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:23:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states. [2019-01-12 11:23:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 11:23:19,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:19,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:19,404 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:19,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2019-01-12 11:23:19,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:19,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:19,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:19,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:19,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:19,625 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-12 11:23:19,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:19,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:23:19,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:23:19,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:23:19,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:23:19,650 INFO L87 Difference]: Start difference. First operand 475 states. Second operand 4 states. [2019-01-12 11:23:21,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:21,769 INFO L93 Difference]: Finished difference Result 486 states and 909 transitions. [2019-01-12 11:23:21,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:23:21,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-12 11:23:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:21,788 INFO L225 Difference]: With dead ends: 486 [2019-01-12 11:23:21,788 INFO L226 Difference]: Without dead ends: 297 [2019-01-12 11:23:21,792 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-12 11:23:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-01-12 11:23:21,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-01-12 11:23:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-01-12 11:23:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2019-01-12 11:23:21,851 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 7 [2019-01-12 11:23:21,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:21,851 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2019-01-12 11:23:21,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:23:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2019-01-12 11:23:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-12 11:23:21,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:21,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:21,853 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:21,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2019-01-12 11:23:21,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:21,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:21,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:21,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:21,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:21,930 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-12 11:23:21,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:21,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:21,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:21,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:21,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:21,933 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand 6 states. [2019-01-12 11:23:22,367 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 11:23:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:24,011 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2019-01-12 11:23:24,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:24,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-01-12 11:23:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:24,022 INFO L225 Difference]: With dead ends: 297 [2019-01-12 11:23:24,025 INFO L226 Difference]: Without dead ends: 292 [2019-01-12 11:23:24,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-01-12 11:23:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-01-12 11:23:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-12 11:23:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2019-01-12 11:23:24,057 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 8 [2019-01-12 11:23:24,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:24,058 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2019-01-12 11:23:24,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2019-01-12 11:23:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-12 11:23:24,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:24,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:24,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash 943449897, now seen corresponding path program 1 times [2019-01-12 11:23:24,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:24,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:24,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:24,738 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-12 11:23:24,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:24,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:23:24,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:23:24,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:23:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:24,740 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand 7 states. [2019-01-12 11:23:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:26,240 INFO L93 Difference]: Finished difference Result 293 states and 296 transitions. [2019-01-12 11:23:26,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:26,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2019-01-12 11:23:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:26,246 INFO L225 Difference]: With dead ends: 293 [2019-01-12 11:23:26,246 INFO L226 Difference]: Without dead ends: 291 [2019-01-12 11:23:26,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-01-12 11:23:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2019-01-12 11:23:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-01-12 11:23:26,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2019-01-12 11:23:26,260 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 244 [2019-01-12 11:23:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:26,261 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2019-01-12 11:23:26,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:23:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2019-01-12 11:23:26,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-12 11:23:26,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:26,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:26,267 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:26,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:26,269 INFO L82 PathProgramCache]: Analyzing trace with hash -817818172, now seen corresponding path program 1 times [2019-01-12 11:23:26,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:26,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:26,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:26,709 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-12 11:23:26,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:26,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:23:26,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:23:26,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:23:26,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:26,711 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand 8 states. [2019-01-12 11:23:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:27,528 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-01-12 11:23:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:23:27,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 245 [2019-01-12 11:23:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:27,532 INFO L225 Difference]: With dead ends: 292 [2019-01-12 11:23:27,532 INFO L226 Difference]: Without dead ends: 290 [2019-01-12 11:23:27,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:23:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-12 11:23:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2019-01-12 11:23:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-12 11:23:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2019-01-12 11:23:27,542 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 245 [2019-01-12 11:23:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:27,543 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2019-01-12 11:23:27,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:23:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2019-01-12 11:23:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-01-12 11:23:27,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:27,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:27,548 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:27,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:27,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1734300147, now seen corresponding path program 1 times [2019-01-12 11:23:27,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:27,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:27,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:27,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:27,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:27,846 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-12 11:23:27,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:27,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:23:27,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:23:27,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:23:27,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:27,848 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand 7 states. [2019-01-12 11:23:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:28,604 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2019-01-12 11:23:28,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:28,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 248 [2019-01-12 11:23:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:28,608 INFO L225 Difference]: With dead ends: 288 [2019-01-12 11:23:28,608 INFO L226 Difference]: Without dead ends: 286 [2019-01-12 11:23:28,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-12 11:23:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2019-01-12 11:23:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-01-12 11:23:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2019-01-12 11:23:28,616 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 248 [2019-01-12 11:23:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:28,617 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2019-01-12 11:23:28,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:23:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2019-01-12 11:23:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-01-12 11:23:28,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:28,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:28,622 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:28,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:28,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2071264176, now seen corresponding path program 1 times [2019-01-12 11:23:28,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:28,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:28,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:28,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:28,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:29,289 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 11:23:29,329 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-12 11:23:29,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:29,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:23:29,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:23:29,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:23:29,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:29,330 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand 8 states. [2019-01-12 11:23:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:30,337 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-01-12 11:23:30,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:23:30,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2019-01-12 11:23:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:30,340 INFO L225 Difference]: With dead ends: 286 [2019-01-12 11:23:30,340 INFO L226 Difference]: Without dead ends: 284 [2019-01-12 11:23:30,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:23:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-12 11:23:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2019-01-12 11:23:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-12 11:23:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 287 transitions. [2019-01-12 11:23:30,347 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 287 transitions. Word has length 249 [2019-01-12 11:23:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:30,348 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 287 transitions. [2019-01-12 11:23:30,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:23:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 287 transitions. [2019-01-12 11:23:30,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-01-12 11:23:30,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:30,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:30,352 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:30,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:30,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1914822156, now seen corresponding path program 1 times [2019-01-12 11:23:30,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:30,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:30,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:30,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:30,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:30,982 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-12 11:23:30,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:30,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:23:30,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:23:30,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:23:30,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:30,989 INFO L87 Difference]: Start difference. First operand 284 states and 287 transitions. Second operand 7 states. [2019-01-12 11:23:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:31,850 INFO L93 Difference]: Finished difference Result 284 states and 287 transitions. [2019-01-12 11:23:31,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:31,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 251 [2019-01-12 11:23:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:31,855 INFO L225 Difference]: With dead ends: 284 [2019-01-12 11:23:31,855 INFO L226 Difference]: Without dead ends: 282 [2019-01-12 11:23:31,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-01-12 11:23:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-01-12 11:23:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-12 11:23:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2019-01-12 11:23:31,865 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 251 [2019-01-12 11:23:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:31,866 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2019-01-12 11:23:31,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:23:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2019-01-12 11:23:31,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-12 11:23:31,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:31,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:31,870 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:31,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:31,870 INFO L82 PathProgramCache]: Analyzing trace with hash 770061441, now seen corresponding path program 1 times [2019-01-12 11:23:31,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:31,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:31,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:31,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:31,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:32,405 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-12 11:23:32,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:32,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:32,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:32,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:32,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:32,410 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand 6 states. [2019-01-12 11:23:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:33,886 INFO L93 Difference]: Finished difference Result 282 states and 285 transitions. [2019-01-12 11:23:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:33,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2019-01-12 11:23:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:33,889 INFO L225 Difference]: With dead ends: 282 [2019-01-12 11:23:33,889 INFO L226 Difference]: Without dead ends: 278 [2019-01-12 11:23:33,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-12 11:23:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-01-12 11:23:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-01-12 11:23:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2019-01-12 11:23:33,896 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 252 [2019-01-12 11:23:33,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:33,897 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2019-01-12 11:23:33,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:33,897 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2019-01-12 11:23:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-01-12 11:23:33,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:33,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:33,899 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:33,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:33,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1881027289, now seen corresponding path program 1 times [2019-01-12 11:23:33,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:33,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:33,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:33,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:33,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:34,357 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-12 11:23:34,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:34,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:23:34,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:23:34,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:23:34,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:34,358 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand 7 states. [2019-01-12 11:23:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:34,909 INFO L93 Difference]: Finished difference Result 278 states and 281 transitions. [2019-01-12 11:23:34,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:34,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 253 [2019-01-12 11:23:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:34,911 INFO L225 Difference]: With dead ends: 278 [2019-01-12 11:23:34,911 INFO L226 Difference]: Without dead ends: 276 [2019-01-12 11:23:34,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-01-12 11:23:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-01-12 11:23:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-12 11:23:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2019-01-12 11:23:34,918 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 253 [2019-01-12 11:23:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:34,919 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2019-01-12 11:23:34,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:23:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2019-01-12 11:23:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-01-12 11:23:34,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:34,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:34,921 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:34,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:34,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1882751193, now seen corresponding path program 1 times [2019-01-12 11:23:34,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:34,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:34,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:34,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:34,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:35,150 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-12 11:23:35,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:35,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:23:35,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:23:35,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:23:35,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:35,152 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand 7 states. [2019-01-12 11:23:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:35,885 INFO L93 Difference]: Finished difference Result 291 states and 296 transitions. [2019-01-12 11:23:35,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:35,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 253 [2019-01-12 11:23:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:35,889 INFO L225 Difference]: With dead ends: 291 [2019-01-12 11:23:35,890 INFO L226 Difference]: Without dead ends: 289 [2019-01-12 11:23:35,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:35,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-12 11:23:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 274. [2019-01-12 11:23:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-12 11:23:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 277 transitions. [2019-01-12 11:23:35,898 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 277 transitions. Word has length 253 [2019-01-12 11:23:35,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:35,898 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 277 transitions. [2019-01-12 11:23:35,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:23:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 277 transitions. [2019-01-12 11:23:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-12 11:23:35,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:35,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:35,933 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:35,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:35,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1817702396, now seen corresponding path program 1 times [2019-01-12 11:23:35,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:35,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:35,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:35,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:35,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:36,347 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 4 [2019-01-12 11:23:36,616 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 11:23:36,724 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-12 11:23:36,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:36,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:23:36,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:23:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:23:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:36,726 INFO L87 Difference]: Start difference. First operand 274 states and 277 transitions. Second operand 8 states. [2019-01-12 11:23:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:37,528 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-01-12 11:23:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:37,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 254 [2019-01-12 11:23:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:37,532 INFO L225 Difference]: With dead ends: 274 [2019-01-12 11:23:37,532 INFO L226 Difference]: Without dead ends: 270 [2019-01-12 11:23:37,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:23:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-12 11:23:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-01-12 11:23:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-01-12 11:23:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2019-01-12 11:23:37,540 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 254 [2019-01-12 11:23:37,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:37,540 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2019-01-12 11:23:37,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:23:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2019-01-12 11:23:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-12 11:23:37,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:37,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:37,545 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:37,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:37,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1818153234, now seen corresponding path program 1 times [2019-01-12 11:23:37,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:37,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:37,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:37,792 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-12 11:23:37,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:37,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:23:37,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:23:37,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:23:37,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:37,793 INFO L87 Difference]: Start difference. First operand 270 states and 273 transitions. Second operand 7 states. [2019-01-12 11:23:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:38,844 INFO L93 Difference]: Finished difference Result 286 states and 291 transitions. [2019-01-12 11:23:38,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:38,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 254 [2019-01-12 11:23:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:38,848 INFO L225 Difference]: With dead ends: 286 [2019-01-12 11:23:38,848 INFO L226 Difference]: Without dead ends: 284 [2019-01-12 11:23:38,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-12 11:23:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2019-01-12 11:23:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-01-12 11:23:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2019-01-12 11:23:38,854 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 254 [2019-01-12 11:23:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:38,855 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2019-01-12 11:23:38,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:23:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2019-01-12 11:23:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-12 11:23:38,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:38,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:38,860 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:38,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:38,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1764261316, now seen corresponding path program 1 times [2019-01-12 11:23:38,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:38,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:38,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:38,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:38,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:39,246 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-12 11:23:39,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:39,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:23:39,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:23:39,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:23:39,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:39,247 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 8 states. [2019-01-12 11:23:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:40,071 INFO L93 Difference]: Finished difference Result 278 states and 283 transitions. [2019-01-12 11:23:40,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:23:40,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 254 [2019-01-12 11:23:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:40,074 INFO L225 Difference]: With dead ends: 278 [2019-01-12 11:23:40,075 INFO L226 Difference]: Without dead ends: 276 [2019-01-12 11:23:40,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:23:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-01-12 11:23:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 266. [2019-01-12 11:23:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-12 11:23:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2019-01-12 11:23:40,081 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 254 [2019-01-12 11:23:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:40,083 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2019-01-12 11:23:40,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:23:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2019-01-12 11:23:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-12 11:23:40,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:40,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:40,087 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:40,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:40,087 INFO L82 PathProgramCache]: Analyzing trace with hash 528181598, now seen corresponding path program 1 times [2019-01-12 11:23:40,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:40,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:40,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:40,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:40,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:40,460 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-12 11:23:40,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:40,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:23:40,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:23:40,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:23:40,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:40,461 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand 8 states. [2019-01-12 11:23:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:41,229 INFO L93 Difference]: Finished difference Result 281 states and 286 transitions. [2019-01-12 11:23:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:23:41,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 255 [2019-01-12 11:23:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:41,232 INFO L225 Difference]: With dead ends: 281 [2019-01-12 11:23:41,232 INFO L226 Difference]: Without dead ends: 279 [2019-01-12 11:23:41,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:23:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-12 11:23:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 264. [2019-01-12 11:23:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-12 11:23:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 267 transitions. [2019-01-12 11:23:41,241 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 267 transitions. Word has length 255 [2019-01-12 11:23:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:41,241 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 267 transitions. [2019-01-12 11:23:41,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:23:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 267 transitions. [2019-01-12 11:23:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-01-12 11:23:41,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:41,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:41,246 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:41,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1056764025, now seen corresponding path program 1 times [2019-01-12 11:23:41,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:41,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:41,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:41,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:41,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:41,658 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-12 11:23:41,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:41,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:23:41,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:23:41,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:23:41,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:41,659 INFO L87 Difference]: Start difference. First operand 264 states and 267 transitions. Second operand 7 states. [2019-01-12 11:23:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:42,412 INFO L93 Difference]: Finished difference Result 264 states and 267 transitions. [2019-01-12 11:23:42,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:42,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 256 [2019-01-12 11:23:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:42,416 INFO L225 Difference]: With dead ends: 264 [2019-01-12 11:23:42,416 INFO L226 Difference]: Without dead ends: 262 [2019-01-12 11:23:42,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-01-12 11:23:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-01-12 11:23:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-12 11:23:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 265 transitions. [2019-01-12 11:23:42,424 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 265 transitions. Word has length 256 [2019-01-12 11:23:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:42,425 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 265 transitions. [2019-01-12 11:23:42,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:23:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 265 transitions. [2019-01-12 11:23:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-01-12 11:23:42,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:42,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:23:42,430 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:42,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1600059765, now seen corresponding path program 1 times [2019-01-12 11:23:42,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:42,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:42,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:42,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:42,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:42,652 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-12 11:23:42,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:42,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:42,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:42,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:42,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:42,654 INFO L87 Difference]: Start difference. First operand 262 states and 265 transitions. Second operand 6 states. [2019-01-12 11:23:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:43,511 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-01-12 11:23:43,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:43,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2019-01-12 11:23:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:43,512 INFO L225 Difference]: With dead ends: 262 [2019-01-12 11:23:43,513 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:23:43,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:23:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:23:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:23:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:23:43,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2019-01-12 11:23:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:43,517 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:23:43,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:23:43,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:23:43,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:23:43,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:23:43,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:23:43,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:23:43,763 INFO L448 ceAbstractionStarter]: For program point L4065(lines 4065 4983) no Hoare annotation was computed. [2019-01-12 11:23:43,763 INFO L448 ceAbstractionStarter]: For program point L3801(lines 3801 5006) no Hoare annotation was computed. [2019-01-12 11:23:43,763 INFO L448 ceAbstractionStarter]: For program point L3537(lines 3537 5029) no Hoare annotation was computed. [2019-01-12 11:23:43,763 INFO L448 ceAbstractionStarter]: For program point L4462(lines 4462 4949) no Hoare annotation was computed. [2019-01-12 11:23:43,763 INFO L448 ceAbstractionStarter]: For program point L4859(lines 4859 4869) no Hoare annotation was computed. [2019-01-12 11:23:43,763 INFO L448 ceAbstractionStarter]: For program point L1028(lines 1028 1052) no Hoare annotation was computed. [2019-01-12 11:23:43,763 INFO L448 ceAbstractionStarter]: For program point L1821(lines 1821 5181) no Hoare annotation was computed. [2019-01-12 11:23:43,763 INFO L448 ceAbstractionStarter]: For program point L1557(lines 1557 5204) no Hoare annotation was computed. [2019-01-12 11:23:43,764 INFO L448 ceAbstractionStarter]: For program point L1293(lines 1293 5227) no Hoare annotation was computed. [2019-01-12 11:23:43,764 INFO L448 ceAbstractionStarter]: For program point L2218(lines 2218 5147) no Hoare annotation was computed. [2019-01-12 11:23:43,764 INFO L448 ceAbstractionStarter]: For program point L3011(lines 3011 3022) no Hoare annotation was computed. [2019-01-12 11:23:43,764 INFO L448 ceAbstractionStarter]: For program point L4861(line 4861) no Hoare annotation was computed. [2019-01-12 11:23:43,764 INFO L444 ceAbstractionStarter]: At program point L501(lines 355 549) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-01-12 11:23:43,764 INFO L448 ceAbstractionStarter]: For program point L3408(lines 3408 3432) no Hoare annotation was computed. [2019-01-12 11:23:43,764 INFO L448 ceAbstractionStarter]: For program point L4201(lines 4201 4971) no Hoare annotation was computed. [2019-01-12 11:23:43,764 INFO L448 ceAbstractionStarter]: For program point L3937(lines 3937 4994) no Hoare annotation was computed. [2019-01-12 11:23:43,765 INFO L448 ceAbstractionStarter]: For program point L3673(lines 3673 5017) no Hoare annotation was computed. [2019-01-12 11:23:43,765 INFO L448 ceAbstractionStarter]: For program point L4598(lines 4598 4937) no Hoare annotation was computed. [2019-01-12 11:23:43,766 INFO L448 ceAbstractionStarter]: For program point L767(lines 767 778) no Hoare annotation was computed. [2019-01-12 11:23:43,766 INFO L448 ceAbstractionStarter]: For program point L1164(lines 1164 1188) no Hoare annotation was computed. [2019-01-12 11:23:43,766 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 114) no Hoare annotation was computed. [2019-01-12 11:23:43,766 INFO L448 ceAbstractionStarter]: For program point L1957(lines 1957 5169) no Hoare annotation was computed. [2019-01-12 11:23:43,766 INFO L448 ceAbstractionStarter]: For program point L1693(lines 1693 5192) no Hoare annotation was computed. [2019-01-12 11:23:43,766 INFO L448 ceAbstractionStarter]: For program point L1429(lines 1429 5215) no Hoare annotation was computed. [2019-01-12 11:23:43,766 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 392) no Hoare annotation was computed. [2019-01-12 11:23:43,766 INFO L448 ceAbstractionStarter]: For program point L2354(lines 2354 5135) no Hoare annotation was computed. [2019-01-12 11:23:43,766 INFO L448 ceAbstractionStarter]: For program point L3147(lines 3147 3158) no Hoare annotation was computed. [2019-01-12 11:23:43,767 INFO L448 ceAbstractionStarter]: For program point L3544(lines 3544 3568) no Hoare annotation was computed. [2019-01-12 11:23:43,767 INFO L448 ceAbstractionStarter]: For program point L4337(lines 4337 4959) no Hoare annotation was computed. [2019-01-12 11:23:43,767 INFO L448 ceAbstractionStarter]: For program point L4073(lines 4073 4982) no Hoare annotation was computed. [2019-01-12 11:23:43,767 INFO L448 ceAbstractionStarter]: For program point L3809(lines 3809 5005) no Hoare annotation was computed. [2019-01-12 11:23:43,767 INFO L444 ceAbstractionStarter]: At program point L638(lines 123 640) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-01-12 11:23:43,767 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 914) no Hoare annotation was computed. [2019-01-12 11:23:43,767 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1324) no Hoare annotation was computed. [2019-01-12 11:23:43,767 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 250) no Hoare annotation was computed. [2019-01-12 11:23:43,767 INFO L448 ceAbstractionStarter]: For program point L2093(lines 2093 5157) no Hoare annotation was computed. [2019-01-12 11:23:43,767 INFO L448 ceAbstractionStarter]: For program point L1829(lines 1829 5180) no Hoare annotation was computed. [2019-01-12 11:23:43,768 INFO L444 ceAbstractionStarter]: At program point L4868(lines 4725 4917) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~271 0)) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~273 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~270 0)) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~34 1) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~272 0))) [2019-01-12 11:23:43,768 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4738) no Hoare annotation was computed. [2019-01-12 11:23:43,768 INFO L448 ceAbstractionStarter]: For program point L4736(lines 4736 4758) no Hoare annotation was computed. [2019-01-12 11:23:43,768 INFO L448 ceAbstractionStarter]: For program point L1565(lines 1565 5203) no Hoare annotation was computed. [2019-01-12 11:23:43,768 INFO L448 ceAbstractionStarter]: For program point L2490(lines 2490 5123) no Hoare annotation was computed. [2019-01-12 11:23:43,768 INFO L448 ceAbstractionStarter]: For program point L3283(lines 3283 3294) no Hoare annotation was computed. [2019-01-12 11:23:43,768 INFO L448 ceAbstractionStarter]: For program point L3680(lines 3680 3704) no Hoare annotation was computed. [2019-01-12 11:23:43,768 INFO L448 ceAbstractionStarter]: For program point L4473(lines 4473 4947) no Hoare annotation was computed. [2019-01-12 11:23:43,768 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4673) no Hoare annotation was computed. [2019-01-12 11:23:43,769 INFO L448 ceAbstractionStarter]: For program point L4209(lines 4209 4970) no Hoare annotation was computed. [2019-01-12 11:23:43,769 INFO L448 ceAbstractionStarter]: For program point L3945(lines 3945 4993) no Hoare annotation was computed. [2019-01-12 11:23:43,769 INFO L448 ceAbstractionStarter]: For program point L4738(line 4738) no Hoare annotation was computed. [2019-01-12 11:23:43,769 INFO L448 ceAbstractionStarter]: For program point L1039(lines 1039 1050) no Hoare annotation was computed. [2019-01-12 11:23:43,769 INFO L448 ceAbstractionStarter]: For program point L1436(lines 1436 1460) no Hoare annotation was computed. [2019-01-12 11:23:43,769 INFO L448 ceAbstractionStarter]: For program point L2229(lines 2229 5145) no Hoare annotation was computed. [2019-01-12 11:23:43,769 INFO L448 ceAbstractionStarter]: For program point L1965(lines 1965 5168) no Hoare annotation was computed. [2019-01-12 11:23:43,769 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 5191) no Hoare annotation was computed. [2019-01-12 11:23:43,769 INFO L448 ceAbstractionStarter]: For program point L2626(lines 2626 5111) no Hoare annotation was computed. [2019-01-12 11:23:43,769 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 546) no Hoare annotation was computed. [2019-01-12 11:23:43,769 INFO L448 ceAbstractionStarter]: For program point L3419(lines 3419 3430) no Hoare annotation was computed. [2019-01-12 11:23:43,770 INFO L448 ceAbstractionStarter]: For program point L3816(lines 3816 3840) no Hoare annotation was computed. [2019-01-12 11:23:43,770 INFO L448 ceAbstractionStarter]: For program point L4609(lines 4609 4935) no Hoare annotation was computed. [2019-01-12 11:23:43,775 INFO L448 ceAbstractionStarter]: For program point L4345(lines 4345 4958) no Hoare annotation was computed. [2019-01-12 11:23:43,775 INFO L448 ceAbstractionStarter]: For program point L4081(lines 4081 4981) no Hoare annotation was computed. [2019-01-12 11:23:43,775 INFO L448 ceAbstractionStarter]: For program point L1175(lines 1175 1186) no Hoare annotation was computed. [2019-01-12 11:23:43,775 INFO L448 ceAbstractionStarter]: For program point L1572(lines 1572 1596) no Hoare annotation was computed. [2019-01-12 11:23:43,775 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 390) no Hoare annotation was computed. [2019-01-12 11:23:43,776 INFO L448 ceAbstractionStarter]: For program point L2365(lines 2365 5133) no Hoare annotation was computed. [2019-01-12 11:23:43,776 INFO L448 ceAbstractionStarter]: For program point L2101(lines 2101 5156) no Hoare annotation was computed. [2019-01-12 11:23:43,776 INFO L448 ceAbstractionStarter]: For program point L1837(lines 1837 5179) no Hoare annotation was computed. [2019-01-12 11:23:43,776 INFO L448 ceAbstractionStarter]: For program point L2762(lines 2762 5099) no Hoare annotation was computed. [2019-01-12 11:23:43,776 INFO L448 ceAbstractionStarter]: For program point L3555(lines 3555 3566) no Hoare annotation was computed. [2019-01-12 11:23:43,776 INFO L448 ceAbstractionStarter]: For program point L3952(lines 3952 3976) no Hoare annotation was computed. [2019-01-12 11:23:43,776 INFO L448 ceAbstractionStarter]: For program point L4481(lines 4481 4946) no Hoare annotation was computed. [2019-01-12 11:23:43,776 INFO L448 ceAbstractionStarter]: For program point L4217(lines 4217 4969) no Hoare annotation was computed. [2019-01-12 11:23:43,776 INFO L448 ceAbstractionStarter]: For program point L1311(lines 1311 1322) no Hoare annotation was computed. [2019-01-12 11:23:43,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-01-12 11:23:43,776 INFO L448 ceAbstractionStarter]: For program point L4879(lines 4879 4914) no Hoare annotation was computed. [2019-01-12 11:23:43,777 INFO L448 ceAbstractionStarter]: For program point L1708(lines 1708 1732) no Hoare annotation was computed. [2019-01-12 11:23:43,777 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 539) no Hoare annotation was computed. [2019-01-12 11:23:43,777 INFO L448 ceAbstractionStarter]: For program point L2501(lines 2501 5121) no Hoare annotation was computed. [2019-01-12 11:23:43,777 INFO L448 ceAbstractionStarter]: For program point L2237(lines 2237 5144) no Hoare annotation was computed. [2019-01-12 11:23:43,777 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 640) no Hoare annotation was computed. [2019-01-12 11:23:43,777 INFO L448 ceAbstractionStarter]: For program point L1973(lines 1973 5167) no Hoare annotation was computed. [2019-01-12 11:23:43,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4709) no Hoare annotation was computed. [2019-01-12 11:23:43,777 INFO L448 ceAbstractionStarter]: For program point L2898(lines 2898 5087) no Hoare annotation was computed. [2019-01-12 11:23:43,777 INFO L448 ceAbstractionStarter]: For program point L3691(lines 3691 3702) no Hoare annotation was computed. [2019-01-12 11:23:43,777 INFO L448 ceAbstractionStarter]: For program point L4748(lines 4748 4756) no Hoare annotation was computed. [2019-01-12 11:23:43,777 INFO L448 ceAbstractionStarter]: For program point L4088(lines 4088 4112) no Hoare annotation was computed. [2019-01-12 11:23:43,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4888) no Hoare annotation was computed. [2019-01-12 11:23:43,778 INFO L448 ceAbstractionStarter]: For program point L4617(lines 4617 4934) no Hoare annotation was computed. [2019-01-12 11:23:43,778 INFO L448 ceAbstractionStarter]: For program point L4353(lines 4353 4957) no Hoare annotation was computed. [2019-01-12 11:23:43,778 INFO L448 ceAbstractionStarter]: For program point L4750(line 4750) no Hoare annotation was computed. [2019-01-12 11:23:43,778 INFO L448 ceAbstractionStarter]: For program point L654(lines 654 5285) no Hoare annotation was computed. [2019-01-12 11:23:43,778 INFO L448 ceAbstractionStarter]: For program point L1447(lines 1447 1458) no Hoare annotation was computed. [2019-01-12 11:23:43,778 INFO L448 ceAbstractionStarter]: For program point L1844(lines 1844 1868) no Hoare annotation was computed. [2019-01-12 11:23:43,778 INFO L448 ceAbstractionStarter]: For program point L2637(lines 2637 5109) no Hoare annotation was computed. [2019-01-12 11:23:43,778 INFO L448 ceAbstractionStarter]: For program point L2373(lines 2373 5132) no Hoare annotation was computed. [2019-01-12 11:23:43,778 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 594) no Hoare annotation was computed. [2019-01-12 11:23:43,778 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 600) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L2109(lines 2109 5155) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L3034(lines 3034 5075) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L3827(lines 3827 3838) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L4224(lines 4224 4248) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L4489(lines 4489 4945) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L4886(lines 4886 4908) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L790(lines 790 5273) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L1583(lines 1583 1594) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L1980(lines 1980 2004) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L2773(lines 2773 5097) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L2509(lines 2509 5120) no Hoare annotation was computed. [2019-01-12 11:23:43,779 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 553) no Hoare annotation was computed. [2019-01-12 11:23:43,780 INFO L448 ceAbstractionStarter]: For program point L2245(lines 2245 5143) no Hoare annotation was computed. [2019-01-12 11:23:43,780 INFO L448 ceAbstractionStarter]: For program point L3170(lines 3170 5063) no Hoare annotation was computed. [2019-01-12 11:23:43,780 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 11:23:43,780 INFO L448 ceAbstractionStarter]: For program point L3963(lines 3963 3974) no Hoare annotation was computed. [2019-01-12 11:23:43,781 INFO L448 ceAbstractionStarter]: For program point L4888(line 4888) no Hoare annotation was computed. [2019-01-12 11:23:43,781 INFO L448 ceAbstractionStarter]: For program point L4360(lines 4360 4384) no Hoare annotation was computed. [2019-01-12 11:23:43,781 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4849) no Hoare annotation was computed. [2019-01-12 11:23:43,781 INFO L448 ceAbstractionStarter]: For program point L4625(lines 4625 4933) no Hoare annotation was computed. [2019-01-12 11:23:43,781 INFO L448 ceAbstractionStarter]: For program point L926(lines 926 5261) no Hoare annotation was computed. [2019-01-12 11:23:43,781 INFO L448 ceAbstractionStarter]: For program point L1719(lines 1719 1730) no Hoare annotation was computed. [2019-01-12 11:23:43,781 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 537) no Hoare annotation was computed. [2019-01-12 11:23:43,781 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4685) no Hoare annotation was computed. [2019-01-12 11:23:43,781 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 189) no Hoare annotation was computed. [2019-01-12 11:23:43,781 INFO L448 ceAbstractionStarter]: For program point L2116(lines 2116 2140) no Hoare annotation was computed. [2019-01-12 11:23:43,781 INFO L448 ceAbstractionStarter]: For program point L2909(lines 2909 5085) no Hoare annotation was computed. [2019-01-12 11:23:43,782 INFO L448 ceAbstractionStarter]: For program point L2645(lines 2645 5108) no Hoare annotation was computed. [2019-01-12 11:23:43,782 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 547) no Hoare annotation was computed. [2019-01-12 11:23:43,782 INFO L448 ceAbstractionStarter]: For program point L2381(lines 2381 5131) no Hoare annotation was computed. [2019-01-12 11:23:43,782 INFO L448 ceAbstractionStarter]: For program point L3306(lines 3306 5051) no Hoare annotation was computed. [2019-01-12 11:23:43,782 INFO L448 ceAbstractionStarter]: For program point L4099(lines 4099 4110) no Hoare annotation was computed. [2019-01-12 11:23:43,782 INFO L448 ceAbstractionStarter]: For program point L4496(lines 4496 4520) no Hoare annotation was computed. [2019-01-12 11:23:43,782 INFO L448 ceAbstractionStarter]: For program point L665(lines 665 5283) no Hoare annotation was computed. [2019-01-12 11:23:43,782 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 5249) no Hoare annotation was computed. [2019-01-12 11:23:43,782 INFO L448 ceAbstractionStarter]: For program point L1855(lines 1855 1866) no Hoare annotation was computed. [2019-01-12 11:23:43,782 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4750) no Hoare annotation was computed. [2019-01-12 11:23:43,782 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 325) no Hoare annotation was computed. [2019-01-12 11:23:43,783 INFO L448 ceAbstractionStarter]: For program point L2252(lines 2252 2276) no Hoare annotation was computed. [2019-01-12 11:23:43,783 INFO L448 ceAbstractionStarter]: For program point L3045(lines 3045 5073) no Hoare annotation was computed. [2019-01-12 11:23:43,783 INFO L448 ceAbstractionStarter]: For program point L2781(lines 2781 5096) no Hoare annotation was computed. [2019-01-12 11:23:43,783 INFO L448 ceAbstractionStarter]: For program point L2517(lines 2517 5119) no Hoare annotation was computed. [2019-01-12 11:23:43,783 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 506) no Hoare annotation was computed. [2019-01-12 11:23:43,783 INFO L448 ceAbstractionStarter]: For program point L3442(lines 3442 5039) no Hoare annotation was computed. [2019-01-12 11:23:43,783 INFO L448 ceAbstractionStarter]: For program point L4235(lines 4235 4246) no Hoare annotation was computed. [2019-01-12 11:23:43,783 INFO L451 ceAbstractionStarter]: At program point L5292(lines 22 5295) the Hoare annotation is: true [2019-01-12 11:23:43,783 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4778) no Hoare annotation was computed. [2019-01-12 11:23:43,783 INFO L448 ceAbstractionStarter]: For program point L4632(lines 4632 4656) no Hoare annotation was computed. [2019-01-12 11:23:43,783 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 5271) no Hoare annotation was computed. [2019-01-12 11:23:43,784 INFO L448 ceAbstractionStarter]: For program point L4765(lines 4765 4915) no Hoare annotation was computed. [2019-01-12 11:23:43,784 INFO L451 ceAbstractionStarter]: At program point L5294(lines 17 5296) the Hoare annotation is: true [2019-01-12 11:23:43,784 INFO L448 ceAbstractionStarter]: For program point L1198(lines 1198 5237) no Hoare annotation was computed. [2019-01-12 11:23:43,784 INFO L448 ceAbstractionStarter]: For program point L1991(lines 1991 2002) no Hoare annotation was computed. [2019-01-12 11:23:43,784 INFO L448 ceAbstractionStarter]: For program point L4898(lines 4898 4906) no Hoare annotation was computed. [2019-01-12 11:23:43,784 INFO L448 ceAbstractionStarter]: For program point L2388(lines 2388 2412) no Hoare annotation was computed. [2019-01-12 11:23:43,784 INFO L448 ceAbstractionStarter]: For program point L3181(lines 3181 5061) no Hoare annotation was computed. [2019-01-12 11:23:43,784 INFO L448 ceAbstractionStarter]: For program point L2917(lines 2917 5084) no Hoare annotation was computed. [2019-01-12 11:23:43,784 INFO L448 ceAbstractionStarter]: For program point L2653(lines 2653 5107) no Hoare annotation was computed. [2019-01-12 11:23:43,784 INFO L448 ceAbstractionStarter]: For program point L3578(lines 3578 5027) no Hoare annotation was computed. [2019-01-12 11:23:43,784 INFO L448 ceAbstractionStarter]: For program point L4371(lines 4371 4382) no Hoare annotation was computed. [2019-01-12 11:23:43,784 INFO L448 ceAbstractionStarter]: For program point L4900(line 4900) no Hoare annotation was computed. [2019-01-12 11:23:43,785 INFO L448 ceAbstractionStarter]: For program point L937(lines 937 5259) no Hoare annotation was computed. [2019-01-12 11:23:43,785 INFO L448 ceAbstractionStarter]: For program point L673(lines 673 5282) no Hoare annotation was computed. [2019-01-12 11:23:43,785 INFO L448 ceAbstractionStarter]: For program point L4769(lines 4769 4873) no Hoare annotation was computed. [2019-01-12 11:23:43,785 INFO L448 ceAbstractionStarter]: For program point L1334(lines 1334 5225) no Hoare annotation was computed. [2019-01-12 11:23:43,785 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 187) no Hoare annotation was computed. [2019-01-12 11:23:43,785 INFO L448 ceAbstractionStarter]: For program point L2127(lines 2127 2138) no Hoare annotation was computed. [2019-01-12 11:23:43,785 INFO L448 ceAbstractionStarter]: For program point L2524(lines 2524 2548) no Hoare annotation was computed. [2019-01-12 11:23:43,785 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 465) no Hoare annotation was computed. [2019-01-12 11:23:43,785 INFO L448 ceAbstractionStarter]: For program point L3317(lines 3317 5049) no Hoare annotation was computed. [2019-01-12 11:23:43,785 INFO L448 ceAbstractionStarter]: For program point L3053(lines 3053 5072) no Hoare annotation was computed. [2019-01-12 11:23:43,785 INFO L448 ceAbstractionStarter]: For program point L2789(lines 2789 5095) no Hoare annotation was computed. [2019-01-12 11:23:43,786 INFO L448 ceAbstractionStarter]: For program point L3714(lines 3714 5015) no Hoare annotation was computed. [2019-01-12 11:23:43,786 INFO L448 ceAbstractionStarter]: For program point L4507(lines 4507 4518) no Hoare annotation was computed. [2019-01-12 11:23:43,786 INFO L448 ceAbstractionStarter]: For program point L1073(lines 1073 5247) no Hoare annotation was computed. [2019-01-12 11:23:43,786 INFO L448 ceAbstractionStarter]: For program point L809(lines 809 5270) no Hoare annotation was computed. [2019-01-12 11:23:43,786 INFO L444 ceAbstractionStarter]: At program point L545(lines 399 547) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-01-12 11:23:43,786 INFO L448 ceAbstractionStarter]: For program point L1470(lines 1470 5213) no Hoare annotation was computed. [2019-01-12 11:23:43,786 INFO L448 ceAbstractionStarter]: For program point L281(lines 281 323) no Hoare annotation was computed. [2019-01-12 11:23:43,786 INFO L448 ceAbstractionStarter]: For program point L2263(lines 2263 2274) no Hoare annotation was computed. [2019-01-12 11:23:43,786 INFO L448 ceAbstractionStarter]: For program point L2660(lines 2660 2684) no Hoare annotation was computed. [2019-01-12 11:23:43,786 INFO L448 ceAbstractionStarter]: For program point L3453(lines 3453 5037) no Hoare annotation was computed. [2019-01-12 11:23:43,786 INFO L448 ceAbstractionStarter]: For program point L3189(lines 3189 5060) no Hoare annotation was computed. [2019-01-12 11:23:43,786 INFO L448 ceAbstractionStarter]: For program point L2925(lines 2925 5083) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L3850(lines 3850 5003) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L4643(lines 4643 4654) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L4776(lines 4776 4835) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L1209(lines 1209 5235) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L945(lines 945 5258) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 5281) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 5201) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L2399(lines 2399 2410) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 186) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L2796(lines 2796 2820) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L4778(line 4778) no Hoare annotation was computed. [2019-01-12 11:23:43,787 INFO L448 ceAbstractionStarter]: For program point L3589(lines 3589 5025) no Hoare annotation was computed. [2019-01-12 11:23:43,788 INFO L448 ceAbstractionStarter]: For program point L3325(lines 3325 5048) no Hoare annotation was computed. [2019-01-12 11:23:43,792 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 5295) no Hoare annotation was computed. [2019-01-12 11:23:43,793 INFO L448 ceAbstractionStarter]: For program point L3061(lines 3061 5071) no Hoare annotation was computed. [2019-01-12 11:23:43,793 INFO L448 ceAbstractionStarter]: For program point L3986(lines 3986 4991) no Hoare annotation was computed. [2019-01-12 11:23:43,793 INFO L448 ceAbstractionStarter]: For program point L1345(lines 1345 5223) no Hoare annotation was computed. [2019-01-12 11:23:43,793 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 5246) no Hoare annotation was computed. [2019-01-12 11:23:43,793 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 5269) no Hoare annotation was computed. [2019-01-12 11:23:43,793 INFO L444 ceAbstractionStarter]: At program point L4913(lines 4765 4915) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~271 0)) (not (= ULTIMATE.start_main_~main__tagbuf_len~0 ULTIMATE.start_main_~main__t~0)) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~273 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~270 0)) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~34 1) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~272 0))) [2019-01-12 11:23:43,793 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 5189) no Hoare annotation was computed. [2019-01-12 11:23:43,793 INFO L448 ceAbstractionStarter]: For program point L2535(lines 2535 2546) no Hoare annotation was computed. [2019-01-12 11:23:43,793 INFO L448 ceAbstractionStarter]: For program point L421(lines 421 463) no Hoare annotation was computed. [2019-01-12 11:23:43,793 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 322) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point L2932(lines 2932 2956) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point L3725(lines 3725 5013) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point L3461(lines 3461 5036) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point L3197(lines 3197 5059) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point L4122(lines 4122 4979) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 5288) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 712) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point L1481(lines 1481 5211) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point L1217(lines 1217 5234) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 180) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:23:43,794 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 5257) no Hoare annotation was computed. [2019-01-12 11:23:43,795 INFO L448 ceAbstractionStarter]: For program point L1878(lines 1878 5177) no Hoare annotation was computed. [2019-01-12 11:23:43,795 INFO L448 ceAbstractionStarter]: For program point L2671(lines 2671 2682) no Hoare annotation was computed. [2019-01-12 11:23:43,795 INFO L444 ceAbstractionStarter]: At program point L4653(lines 63 5287) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-01-12 11:23:43,795 INFO L448 ceAbstractionStarter]: For program point L3068(lines 3068 3092) no Hoare annotation was computed. [2019-01-12 11:23:43,795 INFO L448 ceAbstractionStarter]: For program point L3861(lines 3861 5001) no Hoare annotation was computed. [2019-01-12 11:23:43,795 INFO L448 ceAbstractionStarter]: For program point L3597(lines 3597 5024) no Hoare annotation was computed. [2019-01-12 11:23:43,795 INFO L448 ceAbstractionStarter]: For program point L3333(lines 3333 5047) no Hoare annotation was computed. [2019-01-12 11:23:43,795 INFO L448 ceAbstractionStarter]: For program point L4258(lines 4258 4967) no Hoare annotation was computed. [2019-01-12 11:23:43,795 INFO L448 ceAbstractionStarter]: For program point L559(lines 559 593) no Hoare annotation was computed. [2019-01-12 11:23:43,795 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 848) no Hoare annotation was computed. [2019-01-12 11:23:43,795 INFO L448 ceAbstractionStarter]: For program point L4788(lines 4788 4833) no Hoare annotation was computed. [2019-01-12 11:23:43,795 INFO L448 ceAbstractionStarter]: For program point L1617(lines 1617 5199) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L1353(lines 1353 5222) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 316) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L1089(lines 1089 5245) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L2014(lines 2014 5165) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L2807(lines 2807 2818) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 462) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L3204(lines 3204 3228) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L3997(lines 3997 4989) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L4790(line 4790) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L3733(lines 3733 5012) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L3469(lines 3469 5035) no Hoare annotation was computed. [2019-01-12 11:23:43,796 INFO L448 ceAbstractionStarter]: For program point L4394(lines 4394 4955) no Hoare annotation was computed. [2019-01-12 11:23:43,797 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 56) no Hoare annotation was computed. [2019-01-12 11:23:43,797 INFO L448 ceAbstractionStarter]: For program point L960(lines 960 984) no Hoare annotation was computed. [2019-01-12 11:23:43,797 INFO L448 ceAbstractionStarter]: For program point L1753(lines 1753 5187) no Hoare annotation was computed. [2019-01-12 11:23:43,797 INFO L448 ceAbstractionStarter]: For program point L1489(lines 1489 5210) no Hoare annotation was computed. [2019-01-12 11:23:43,797 INFO L448 ceAbstractionStarter]: For program point L1225(lines 1225 5233) no Hoare annotation was computed. [2019-01-12 11:23:43,797 INFO L448 ceAbstractionStarter]: For program point L2150(lines 2150 5153) no Hoare annotation was computed. [2019-01-12 11:23:43,797 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-12 11:23:43,797 INFO L448 ceAbstractionStarter]: For program point L2943(lines 2943 2954) no Hoare annotation was computed. [2019-01-12 11:23:43,797 INFO L448 ceAbstractionStarter]: For program point L3340(lines 3340 3364) no Hoare annotation was computed. [2019-01-12 11:23:43,797 INFO L448 ceAbstractionStarter]: For program point L4133(lines 4133 4977) no Hoare annotation was computed. [2019-01-12 11:23:43,797 INFO L444 ceAbstractionStarter]: At program point L4926(lines 4660 4933) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~main__tagbuf_len~0 ULTIMATE.start_main_~main__t~0)) (<= 1 ULTIMATE.start_main_~main__t~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~34 1)) [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L3869(lines 3869 5000) no Hoare annotation was computed. [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 586) no Hoare annotation was computed. [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L3605(lines 3605 5023) no Hoare annotation was computed. [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L4530(lines 4530 4943) no Hoare annotation was computed. [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 178) no Hoare annotation was computed. [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L1096(lines 1096 1120) no Hoare annotation was computed. [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L1889(lines 1889 5175) no Hoare annotation was computed. [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L1625(lines 1625 5198) no Hoare annotation was computed. [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 456) no Hoare annotation was computed. [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L1361(lines 1361 5221) no Hoare annotation was computed. [2019-01-12 11:23:43,798 INFO L448 ceAbstractionStarter]: For program point L2286(lines 2286 5141) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L3079(lines 3079 3090) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L4797(lines 4797 4832) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L3476(lines 3476 3500) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L4269(lines 4269 4965) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L4005(lines 4005 4988) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L3741(lines 3741 5011) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L835(lines 835 846) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 314) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L1232(lines 1232 1256) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L2025(lines 2025 5163) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L1761(lines 1761 5186) no Hoare annotation was computed. [2019-01-12 11:23:43,799 INFO L448 ceAbstractionStarter]: For program point L1497(lines 1497 5209) no Hoare annotation was computed. [2019-01-12 11:23:43,800 INFO L448 ceAbstractionStarter]: For program point L2422(lines 2422 5129) no Hoare annotation was computed. [2019-01-12 11:23:43,802 INFO L448 ceAbstractionStarter]: For program point L3215(lines 3215 3226) no Hoare annotation was computed. [2019-01-12 11:23:43,802 INFO L448 ceAbstractionStarter]: For program point L3612(lines 3612 3636) no Hoare annotation was computed. [2019-01-12 11:23:43,802 INFO L448 ceAbstractionStarter]: For program point L4405(lines 4405 4953) no Hoare annotation was computed. [2019-01-12 11:23:43,802 INFO L448 ceAbstractionStarter]: For program point L4141(lines 4141 4976) no Hoare annotation was computed. [2019-01-12 11:23:43,802 INFO L448 ceAbstractionStarter]: For program point L3877(lines 3877 4999) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 54) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L4671(lines 4671 4931) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L1368(lines 1368 1392) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L2161(lines 2161 5151) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L1897(lines 1897 5174) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L4804(lines 4804 4826) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L1633(lines 1633 5197) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L2558(lines 2558 5117) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L3351(lines 3351 3362) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-01-12 11:23:43,803 INFO L448 ceAbstractionStarter]: For program point L3748(lines 3748 3772) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L577(lines 577 584) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L4673(line 4673) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L4541(lines 4541 4941) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L4277(lines 4277 4964) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L4013(lines 4013 4987) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L4806(line 4806) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L1107(lines 1107 1118) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L1504(lines 1504 1528) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 454) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L2297(lines 2297 5139) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L2033(lines 2033 5162) no Hoare annotation was computed. [2019-01-12 11:23:43,804 INFO L448 ceAbstractionStarter]: For program point L1769(lines 1769 5185) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L2694(lines 2694 5105) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L3487(lines 3487 3498) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L3884(lines 3884 3908) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L4413(lines 4413 4952) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L4149(lines 4149 4975) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1254) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1664) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L2433(lines 2433 5127) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L2169(lines 2169 5150) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L1905(lines 1905 5173) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L2830(lines 2830 5093) no Hoare annotation was computed. [2019-01-12 11:23:43,805 INFO L448 ceAbstractionStarter]: For program point L3623(lines 3623 3634) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point L4020(lines 4020 4044) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point L4549(lines 4549 4940) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point L4285(lines 4285 4963) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point L1379(lines 1379 1390) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point L1776(lines 1776 1800) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point L4683(lines 4683 4929) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point L2569(lines 2569 5115) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point L2305(lines 2305 5138) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point L2041(lines 2041 5161) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point L2966(lines 2966 5081) no Hoare annotation was computed. [2019-01-12 11:23:43,806 INFO L448 ceAbstractionStarter]: For program point L3759(lines 3759 3770) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L4816(lines 4816 4824) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L4156(lines 4156 4180) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L4685(line 4685) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L4421(lines 4421 4951) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L4818(line 4818) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L722(lines 722 5279) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L1515(lines 1515 1526) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L1912(lines 1912 1936) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L2705(lines 2705 5103) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L2441(lines 2441 5126) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L2177(lines 2177 5149) no Hoare annotation was computed. [2019-01-12 11:23:43,807 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 5287) no Hoare annotation was computed. [2019-01-12 11:23:43,808 INFO L448 ceAbstractionStarter]: For program point L3102(lines 3102 5069) no Hoare annotation was computed. [2019-01-12 11:23:43,808 INFO L448 ceAbstractionStarter]: For program point L3895(lines 3895 3906) no Hoare annotation was computed. [2019-01-12 11:23:43,809 INFO L444 ceAbstractionStarter]: At program point L592(lines 259 594) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-01-12 11:23:43,809 INFO L448 ceAbstractionStarter]: For program point L4292(lines 4292 4316) no Hoare annotation was computed. [2019-01-12 11:23:43,809 INFO L448 ceAbstractionStarter]: For program point L4557(lines 4557 4939) no Hoare annotation was computed. [2019-01-12 11:23:43,809 INFO L448 ceAbstractionStarter]: For program point L858(lines 858 5267) no Hoare annotation was computed. [2019-01-12 11:23:43,810 INFO L448 ceAbstractionStarter]: For program point L1651(lines 1651 1662) no Hoare annotation was computed. [2019-01-12 11:23:43,816 INFO L444 ceAbstractionStarter]: At program point L330(lines 263 553) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-01-12 11:23:43,816 INFO L448 ceAbstractionStarter]: For program point L2048(lines 2048 2072) no Hoare annotation was computed. [2019-01-12 11:23:43,816 INFO L448 ceAbstractionStarter]: For program point L2841(lines 2841 5091) no Hoare annotation was computed. [2019-01-12 11:23:43,816 INFO L448 ceAbstractionStarter]: For program point L2577(lines 2577 5114) no Hoare annotation was computed. [2019-01-12 11:23:43,816 INFO L448 ceAbstractionStarter]: For program point L2313(lines 2313 5137) no Hoare annotation was computed. [2019-01-12 11:23:43,816 INFO L448 ceAbstractionStarter]: For program point L3238(lines 3238 5057) no Hoare annotation was computed. [2019-01-12 11:23:43,816 INFO L448 ceAbstractionStarter]: For program point L4031(lines 4031 4042) no Hoare annotation was computed. [2019-01-12 11:23:43,816 INFO L448 ceAbstractionStarter]: For program point L4692(lines 4692 4928) no Hoare annotation was computed. [2019-01-12 11:23:43,816 INFO L448 ceAbstractionStarter]: For program point L4428(lines 4428 4452) no Hoare annotation was computed. [2019-01-12 11:23:43,817 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 598) no Hoare annotation was computed. [2019-01-12 11:23:43,817 INFO L448 ceAbstractionStarter]: For program point L994(lines 994 5255) no Hoare annotation was computed. [2019-01-12 11:23:43,817 INFO L448 ceAbstractionStarter]: For program point L1787(lines 1787 1798) no Hoare annotation was computed. [2019-01-12 11:23:43,817 INFO L444 ceAbstractionStarter]: At program point L4694(lines 26 5288) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-01-12 11:23:43,817 INFO L448 ceAbstractionStarter]: For program point L2184(lines 2184 2208) no Hoare annotation was computed. [2019-01-12 11:23:43,817 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 644) no Hoare annotation was computed. [2019-01-12 11:23:43,817 INFO L448 ceAbstractionStarter]: For program point L2977(lines 2977 5079) no Hoare annotation was computed. [2019-01-12 11:23:43,817 INFO L448 ceAbstractionStarter]: For program point L2713(lines 2713 5102) no Hoare annotation was computed. [2019-01-12 11:23:43,817 INFO L448 ceAbstractionStarter]: For program point L2449(lines 2449 5125) no Hoare annotation was computed. [2019-01-12 11:23:43,817 INFO L448 ceAbstractionStarter]: For program point L3374(lines 3374 5045) no Hoare annotation was computed. [2019-01-12 11:23:43,817 INFO L448 ceAbstractionStarter]: For program point L4167(lines 4167 4178) no Hoare annotation was computed. [2019-01-12 11:23:43,817 INFO L448 ceAbstractionStarter]: For program point L4564(lines 4564 4588) no Hoare annotation was computed. [2019-01-12 11:23:43,818 INFO L448 ceAbstractionStarter]: For program point L733(lines 733 5277) no Hoare annotation was computed. [2019-01-12 11:23:43,820 INFO L448 ceAbstractionStarter]: For program point L1130(lines 1130 5243) no Hoare annotation was computed. [2019-01-12 11:23:43,820 INFO L448 ceAbstractionStarter]: For program point L1923(lines 1923 1934) no Hoare annotation was computed. [2019-01-12 11:23:43,820 INFO L444 ceAbstractionStarter]: At program point L470(lines 403 506) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-01-12 11:23:43,820 INFO L448 ceAbstractionStarter]: For program point L2320(lines 2320 2344) no Hoare annotation was computed. [2019-01-12 11:23:43,820 INFO L448 ceAbstractionStarter]: For program point L3113(lines 3113 5067) no Hoare annotation was computed. [2019-01-12 11:23:43,820 INFO L448 ceAbstractionStarter]: For program point L2849(lines 2849 5090) no Hoare annotation was computed. [2019-01-12 11:23:43,820 INFO L448 ceAbstractionStarter]: For program point L2585(lines 2585 5113) no Hoare annotation was computed. [2019-01-12 11:23:43,820 INFO L448 ceAbstractionStarter]: For program point L3510(lines 3510 5033) no Hoare annotation was computed. [2019-01-12 11:23:43,820 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 551) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point L4303(lines 4303 4314) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point L4700(lines 4700 4927) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point L869(lines 869 5265) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point L1266(lines 1266 5231) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point L2059(lines 2059 2070) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 639) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point L2456(lines 2456 2480) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point L3249(lines 3249 5055) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point L2985(lines 2985 5078) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point L2721(lines 2721 5101) no Hoare annotation was computed. [2019-01-12 11:23:43,821 INFO L448 ceAbstractionStarter]: For program point L3646(lines 3646 5021) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L4439(lines 4439 4450) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 596) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 5253) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 5276) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L1402(lines 1402 5219) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L2195(lines 2195 2206) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 642) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L2592(lines 2592 2616) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L3385(lines 3385 5043) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L3121(lines 3121 5066) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L2857(lines 2857 5089) no Hoare annotation was computed. [2019-01-12 11:23:43,822 INFO L448 ceAbstractionStarter]: For program point L3782(lines 3782 5009) no Hoare annotation was computed. [2019-01-12 11:23:43,823 INFO L448 ceAbstractionStarter]: For program point L4707(lines 4707 4919) no Hoare annotation was computed. [2019-01-12 11:23:43,823 INFO L448 ceAbstractionStarter]: For program point L4575(lines 4575 4586) no Hoare annotation was computed. [2019-01-12 11:23:43,828 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 504) no Hoare annotation was computed. [2019-01-12 11:23:43,828 INFO L448 ceAbstractionStarter]: For program point L1141(lines 1141 5241) no Hoare annotation was computed. [2019-01-12 11:23:43,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4721) no Hoare annotation was computed. [2019-01-12 11:23:43,828 INFO L448 ceAbstractionStarter]: For program point L877(lines 877 5264) no Hoare annotation was computed. [2019-01-12 11:23:43,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4861) no Hoare annotation was computed. [2019-01-12 11:23:43,828 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 633) no Hoare annotation was computed. [2019-01-12 11:23:43,828 INFO L448 ceAbstractionStarter]: For program point L4709(line 4709) no Hoare annotation was computed. [2019-01-12 11:23:43,829 INFO L448 ceAbstractionStarter]: For program point L1538(lines 1538 5207) no Hoare annotation was computed. [2019-01-12 11:23:43,829 INFO L448 ceAbstractionStarter]: For program point L2331(lines 2331 2342) no Hoare annotation was computed. [2019-01-12 11:23:43,829 INFO L448 ceAbstractionStarter]: For program point L2728(lines 2728 2752) no Hoare annotation was computed. [2019-01-12 11:23:43,829 INFO L448 ceAbstractionStarter]: For program point L3521(lines 3521 5031) no Hoare annotation was computed. [2019-01-12 11:23:43,829 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 549) no Hoare annotation was computed. [2019-01-12 11:23:43,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:23:43,829 INFO L448 ceAbstractionStarter]: For program point L3257(lines 3257 5054) no Hoare annotation was computed. [2019-01-12 11:23:43,829 INFO L448 ceAbstractionStarter]: For program point L2993(lines 2993 5077) no Hoare annotation was computed. [2019-01-12 11:23:43,829 INFO L448 ceAbstractionStarter]: For program point L3918(lines 3918 4997) no Hoare annotation was computed. [2019-01-12 11:23:43,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-01-12 11:23:43,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4806) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 5229) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L1013(lines 1013 5252) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L749(lines 749 5275) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L1674(lines 1674 5195) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L2467(lines 2467 2478) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 641) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L2864(lines 2864 2888) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L3657(lines 3657 5019) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L3393(lines 3393 5042) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L3129(lines 3129 5065) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L4054(lines 4054 4985) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point L4847(lines 4847 4871) no Hoare annotation was computed. [2019-01-12 11:23:43,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4818) no Hoare annotation was computed. [2019-01-12 11:23:43,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4790) no Hoare annotation was computed. [2019-01-12 11:23:43,834 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 5217) no Hoare annotation was computed. [2019-01-12 11:23:43,834 INFO L448 ceAbstractionStarter]: For program point L1149(lines 1149 5240) no Hoare annotation was computed. [2019-01-12 11:23:43,834 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 5263) no Hoare annotation was computed. [2019-01-12 11:23:43,834 INFO L448 ceAbstractionStarter]: For program point L1810(lines 1810 5183) no Hoare annotation was computed. [2019-01-12 11:23:43,834 INFO L448 ceAbstractionStarter]: For program point L4849(line 4849) no Hoare annotation was computed. [2019-01-12 11:23:43,834 INFO L448 ceAbstractionStarter]: For program point L2603(lines 2603 2614) no Hoare annotation was computed. [2019-01-12 11:23:43,834 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 595) no Hoare annotation was computed. [2019-01-12 11:23:43,834 INFO L448 ceAbstractionStarter]: For program point L3000(lines 3000 3024) no Hoare annotation was computed. [2019-01-12 11:23:43,834 INFO L448 ceAbstractionStarter]: For program point L3793(lines 3793 5007) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L3529(lines 3529 5030) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L3265(lines 3265 5053) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L4190(lines 4190 4973) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L4719(lines 4719 4917) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L756(lines 756 780) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L624(lines 624 631) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L1549(lines 1549 5205) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L1285(lines 1285 5228) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 116) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L1021(lines 1021 5251) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L1946(lines 1946 5171) no Hoare annotation was computed. [2019-01-12 11:23:43,835 INFO L448 ceAbstractionStarter]: For program point L2739(lines 2739 2750) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L4721(line 4721) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L3136(lines 3136 3160) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L3929(lines 3929 4995) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L3665(lines 3665 5018) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L3401(lines 3401 5041) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L4326(lines 4326 4961) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L892(lines 892 916) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 5193) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L1421(lines 1421 5216) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 252) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L1157(lines 1157 5239) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L2082(lines 2082 5159) no Hoare annotation was computed. [2019-01-12 11:23:43,836 INFO L448 ceAbstractionStarter]: For program point L2875(lines 2875 2886) no Hoare annotation was computed. [2019-01-12 11:23:43,837 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 548) no Hoare annotation was computed. [2019-01-12 11:23:43,840 INFO L448 ceAbstractionStarter]: For program point L3272(lines 3272 3296) no Hoare annotation was computed. [2019-01-12 11:23:43,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:23:43 BoogieIcfgContainer [2019-01-12 11:23:43,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:23:43,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:23:43,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:23:43,892 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:23:43,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:23:19" (3/4) ... [2019-01-12 11:23:43,903 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:23:43,975 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 11:23:43,981 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:23:44,337 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:23:44,337 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:23:44,338 INFO L168 Benchmark]: Toolchain (without parser) took 30766.52 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 523.2 MB). Free memory was 945.9 MB in the beginning and 1.4 GB in the end (delta: -412.7 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:44,339 INFO L168 Benchmark]: CDTParser took 0.15 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-12 11:23:44,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1465.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:44,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 204.35 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:44,340 INFO L168 Benchmark]: Boogie Preprocessor took 133.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:44,341 INFO L168 Benchmark]: RCFGBuilder took 3851.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 777.9 MB in the end (delta: 318.5 MB). Peak memory consumption was 318.5 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:44,341 INFO L168 Benchmark]: TraceAbstraction took 24657.96 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 391.6 MB). Free memory was 777.9 MB in the beginning and 1.4 GB in the end (delta: -654.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:23:44,341 INFO L168 Benchmark]: Witness Printer took 445.53 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 73.6 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:44,346 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.15 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 1465.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 204.35 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3851.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 777.9 MB in the end (delta: 318.5 MB). Peak memory consumption was 318.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24657.96 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 391.6 MB). Free memory was 777.9 MB in the beginning and 1.4 GB in the end (delta: -654.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 445.53 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 73.6 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4673]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4738]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4888]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4806]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4861]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4818]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4721]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4750]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4778]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4849]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4790]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4709]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 48]: 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: 63]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4725]: Loop Invariant Derived loop invariant: (((((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 4660]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 4765]: Loop Invariant Derived loop invariant: ((((((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == main__t)) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 475 locations, 16 error locations. SAFE Result, 24.4s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 17.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 724 SDtfs, 11138 SDslu, 762 SDs, 0 SdLazy, 10691 SolverSat, 3425 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 59 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 18 NumberOfFragments, 101 HoareAnnotationTreeSize, 13 FomulaSimplifications, 1461 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 105 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 3540 NumberOfCodeBlocks, 3540 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3524 ConstructedInterpolants, 0 QuantifiedInterpolants, 961880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...