./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.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/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.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 f8826e63977e5204bfb153113fa32b1df4948bea ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 00:55:47,490 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:55:47,492 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:55:47,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:55:47,504 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:55:47,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:55:47,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:55:47,508 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:55:47,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:55:47,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:55:47,511 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:55:47,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:55:47,512 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:55:47,513 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:55:47,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:55:47,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:55:47,516 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:55:47,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:55:47,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:55:47,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:55:47,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:55:47,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:55:47,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:55:47,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:55:47,534 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:55:47,534 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:55:47,535 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:55:47,536 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:55:47,537 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:55:47,538 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:55:47,538 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:55:47,539 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:55:47,539 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:55:47,539 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:55:47,540 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:55:47,541 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:55:47,543 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:55:47,571 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:55:47,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:55:47,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:55:47,574 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:55:47,574 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:55:47,574 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:55:47,575 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:55:47,575 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:55:47,575 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:55:47,575 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:55:47,575 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:55:47,575 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:55:47,576 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:55:47,576 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:55:47,576 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:55:47,576 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:55:47,577 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:55:47,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:55:47,577 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:55:47,577 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:55:47,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:55:47,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:55:47,578 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:55:47,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:55:47,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:55:47,578 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:55:47,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:55:47,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:55:47,580 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 -> f8826e63977e5204bfb153113fa32b1df4948bea [2019-01-12 00:55:47,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:55:47,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:55:47,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:55:47,659 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:55:47,660 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:55:47,660 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.c [2019-01-12 00:55:47,712 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b36254ab/e7de626a17f6476ca629b38f50d5716b/FLAG8af293b4e [2019-01-12 00:55:48,201 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:55:48,202 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.c [2019-01-12 00:55:48,217 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b36254ab/e7de626a17f6476ca629b38f50d5716b/FLAG8af293b4e [2019-01-12 00:55:48,507 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b36254ab/e7de626a17f6476ca629b38f50d5716b [2019-01-12 00:55:48,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:55:48,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:55:48,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:55:48,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:55:48,520 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:55:48,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:55:48" (1/1) ... [2019-01-12 00:55:48,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5524172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:48, skipping insertion in model container [2019-01-12 00:55:48,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:55:48" (1/1) ... [2019-01-12 00:55:48,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:55:48,602 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:55:49,059 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:55:49,064 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:55:49,211 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:55:49,228 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:55:49,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49 WrapperNode [2019-01-12 00:55:49,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:55:49,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:55:49,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:55:49,230 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:55:49,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49" (1/1) ... [2019-01-12 00:55:49,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49" (1/1) ... [2019-01-12 00:55:49,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:55:49,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:55:49,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:55:49,390 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:55:49,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49" (1/1) ... [2019-01-12 00:55:49,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49" (1/1) ... [2019-01-12 00:55:49,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49" (1/1) ... [2019-01-12 00:55:49,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49" (1/1) ... [2019-01-12 00:55:49,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49" (1/1) ... [2019-01-12 00:55:49,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49" (1/1) ... [2019-01-12 00:55:49,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49" (1/1) ... [2019-01-12 00:55:49,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:55:49,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:55:49,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:55:49,452 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:55:49,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49" (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 00:55:49,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:55:49,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:55:52,424 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:55:52,425 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:55:52,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:52 BoogieIcfgContainer [2019-01-12 00:55:52,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:55:52,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:55:52,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:55:52,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:55:52,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:55:48" (1/3) ... [2019-01-12 00:55:52,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2635e2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:55:52, skipping insertion in model container [2019-01-12 00:55:52,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:49" (2/3) ... [2019-01-12 00:55:52,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2635e2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:55:52, skipping insertion in model container [2019-01-12 00:55:52,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:52" (3/3) ... [2019-01-12 00:55:52,434 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label28_true-unreach-call_false-termination.c [2019-01-12 00:55:52,442 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:55:52,450 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:55:52,464 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:55:52,497 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:55:52,498 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:55:52,498 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:55:52,498 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:55:52,499 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:55:52,499 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:55:52,499 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:55:52,499 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:55:52,500 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:55:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:55:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-12 00:55:52,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:52,537 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] [2019-01-12 00:55:52,539 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:52,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1341014581, now seen corresponding path program 1 times [2019-01-12 00:55:52,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:52,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:52,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:52,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:52,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:53,101 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 00:55:53,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:53,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:53,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:53,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:53,129 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-01-12 00:55:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:56,496 INFO L93 Difference]: Finished difference Result 747 states and 1324 transitions. [2019-01-12 00:55:56,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:56,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-01-12 00:55:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:56,517 INFO L225 Difference]: With dead ends: 747 [2019-01-12 00:55:56,518 INFO L226 Difference]: Without dead ends: 453 [2019-01-12 00:55:56,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-01-12 00:55:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2019-01-12 00:55:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-01-12 00:55:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 614 transitions. [2019-01-12 00:55:56,594 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 614 transitions. Word has length 124 [2019-01-12 00:55:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:56,595 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 614 transitions. [2019-01-12 00:55:56,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 614 transitions. [2019-01-12 00:55:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-12 00:55:56,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:56,601 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:55:56,601 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:56,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1158054710, now seen corresponding path program 1 times [2019-01-12 00:55:56,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:56,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:56,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:57,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:57,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 00:55:57,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 00:55:57,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 00:55:57,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:55:57,187 INFO L87 Difference]: Start difference. First operand 449 states and 614 transitions. Second operand 10 states. [2019-01-12 00:55:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:59,879 INFO L93 Difference]: Finished difference Result 1680 states and 2320 transitions. [2019-01-12 00:55:59,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 00:55:59,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2019-01-12 00:55:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:59,890 INFO L225 Difference]: With dead ends: 1680 [2019-01-12 00:55:59,890 INFO L226 Difference]: Without dead ends: 1233 [2019-01-12 00:55:59,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:55:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-01-12 00:55:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1227. [2019-01-12 00:55:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2019-01-12 00:55:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1511 transitions. [2019-01-12 00:55:59,978 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1511 transitions. Word has length 133 [2019-01-12 00:55:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:59,979 INFO L480 AbstractCegarLoop]: Abstraction has 1227 states and 1511 transitions. [2019-01-12 00:55:59,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 00:55:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1511 transitions. [2019-01-12 00:55:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-12 00:55:59,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:59,989 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:55:59,989 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2063368431, now seen corresponding path program 1 times [2019-01-12 00:55:59,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:59,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:59,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:00,264 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 00:56:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:56:00,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:00,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:56:00,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:00,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:00,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:00,299 INFO L87 Difference]: Start difference. First operand 1227 states and 1511 transitions. Second operand 4 states. [2019-01-12 00:56:02,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:02,543 INFO L93 Difference]: Finished difference Result 3724 states and 4632 transitions. [2019-01-12 00:56:02,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:02,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-01-12 00:56:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:02,554 INFO L225 Difference]: With dead ends: 3724 [2019-01-12 00:56:02,554 INFO L226 Difference]: Without dead ends: 1937 [2019-01-12 00:56:02,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2019-01-12 00:56:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1508. [2019-01-12 00:56:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2019-01-12 00:56:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1795 transitions. [2019-01-12 00:56:02,592 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1795 transitions. Word has length 162 [2019-01-12 00:56:02,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:02,592 INFO L480 AbstractCegarLoop]: Abstraction has 1508 states and 1795 transitions. [2019-01-12 00:56:02,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1795 transitions. [2019-01-12 00:56:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-12 00:56:02,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:02,598 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:56:02,598 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash 724861720, now seen corresponding path program 1 times [2019-01-12 00:56:02,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:02,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:02,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:02,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-12 00:56:02,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:02,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:56:02,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:02,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:02,771 INFO L87 Difference]: Start difference. First operand 1508 states and 1795 transitions. Second operand 4 states. [2019-01-12 00:56:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:03,952 INFO L93 Difference]: Finished difference Result 3861 states and 4630 transitions. [2019-01-12 00:56:03,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:03,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-01-12 00:56:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:03,962 INFO L225 Difference]: With dead ends: 3861 [2019-01-12 00:56:03,962 INFO L226 Difference]: Without dead ends: 2215 [2019-01-12 00:56:03,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-01-12 00:56:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1929. [2019-01-12 00:56:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2019-01-12 00:56:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2172 transitions. [2019-01-12 00:56:04,005 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2172 transitions. Word has length 188 [2019-01-12 00:56:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:04,006 INFO L480 AbstractCegarLoop]: Abstraction has 1929 states and 2172 transitions. [2019-01-12 00:56:04,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2172 transitions. [2019-01-12 00:56:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-01-12 00:56:04,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:04,012 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:56:04,012 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash 94131159, now seen corresponding path program 1 times [2019-01-12 00:56:04,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:04,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:04,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:04,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:04,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-12 00:56:04,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:04,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:04,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:56:04,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:56:04,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:04,278 INFO L87 Difference]: Start difference. First operand 1929 states and 2172 transitions. Second operand 3 states. [2019-01-12 00:56:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:05,082 INFO L93 Difference]: Finished difference Result 3850 states and 4304 transitions. [2019-01-12 00:56:05,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:56:05,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-01-12 00:56:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:05,090 INFO L225 Difference]: With dead ends: 3850 [2019-01-12 00:56:05,090 INFO L226 Difference]: Without dead ends: 1923 [2019-01-12 00:56:05,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-01-12 00:56:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1643. [2019-01-12 00:56:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2019-01-12 00:56:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 1810 transitions. [2019-01-12 00:56:05,125 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 1810 transitions. Word has length 236 [2019-01-12 00:56:05,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:05,125 INFO L480 AbstractCegarLoop]: Abstraction has 1643 states and 1810 transitions. [2019-01-12 00:56:05,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:56:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 1810 transitions. [2019-01-12 00:56:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-12 00:56:05,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:05,131 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:56:05,131 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:05,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:05,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1242960576, now seen corresponding path program 1 times [2019-01-12 00:56:05,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:05,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:05,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-01-12 00:56:05,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:05,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:05,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:56:05,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:56:05,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:05,307 INFO L87 Difference]: Start difference. First operand 1643 states and 1810 transitions. Second operand 3 states. [2019-01-12 00:56:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:05,946 INFO L93 Difference]: Finished difference Result 3423 states and 3766 transitions. [2019-01-12 00:56:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:56:05,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-01-12 00:56:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:05,954 INFO L225 Difference]: With dead ends: 3423 [2019-01-12 00:56:05,954 INFO L226 Difference]: Without dead ends: 1641 [2019-01-12 00:56:05,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-01-12 00:56:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1361. [2019-01-12 00:56:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2019-01-12 00:56:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1465 transitions. [2019-01-12 00:56:05,982 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1465 transitions. Word has length 258 [2019-01-12 00:56:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:05,982 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 1465 transitions. [2019-01-12 00:56:05,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:56:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1465 transitions. [2019-01-12 00:56:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-12 00:56:05,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:05,987 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:56:05,988 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:05,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:05,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1732894879, now seen corresponding path program 1 times [2019-01-12 00:56:05,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:05,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:05,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:05,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:05,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-12 00:56:06,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:06,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:06,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:56:06,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:56:06,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:06,123 INFO L87 Difference]: Start difference. First operand 1361 states and 1465 transitions. Second operand 3 states. [2019-01-12 00:56:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:06,607 INFO L93 Difference]: Finished difference Result 2999 states and 3211 transitions. [2019-01-12 00:56:06,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:56:06,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-01-12 00:56:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:06,608 INFO L225 Difference]: With dead ends: 2999 [2019-01-12 00:56:06,608 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:56:06,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:56:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:56:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:56:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:56:06,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2019-01-12 00:56:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:06,612 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:56:06,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:56:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:56:06,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:56:06,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:56:06,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:56:06,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:56:07,536 WARN L181 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-12 00:56:07,843 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-12 00:56:07,846 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,846 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,846 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,847 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:56:07,847 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:56:07,847 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:56:07,847 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:56:07,847 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:56:07,847 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:56:07,847 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:56:07,847 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,847 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,848 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,848 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:56:07,848 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:56:07,848 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:56:07,848 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:56:07,848 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:56:07,848 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:56:07,848 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:56:07,848 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,848 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,849 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,849 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:56:07,849 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:56:07,849 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:56:07,849 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:56:07,849 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:56:07,849 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,849 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,849 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,850 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:56:07,850 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:56:07,850 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:56:07,851 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:56:07,851 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:56:07,851 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:56:07,851 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:56:07,851 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:56:07,851 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,851 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,851 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,851 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:56:07,852 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:56:07,852 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:56:07,852 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:56:07,852 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:56:07,852 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:56:07,852 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:56:07,852 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:56:07,852 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,852 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,852 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,853 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:56:07,853 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:56:07,853 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:56:07,853 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:56:07,853 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:56:07,853 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:56:07,853 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:56:07,853 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:56:07,853 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:56:07,853 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,854 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,854 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,854 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:56:07,854 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:56:07,854 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:56:07,854 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:56:07,854 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:56:07,854 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:56:07,854 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,854 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,854 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,855 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:56:07,855 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:56:07,855 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:56:07,855 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:56:07,855 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:56:07,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:56:07,855 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:56:07,855 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:56:07,855 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:56:07,855 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,855 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,856 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,856 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:56:07,856 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:56:07,856 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:56:07,856 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:56:07,856 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:56:07,856 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,856 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,856 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,856 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:56:07,857 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:56:07,857 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:56:07,857 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:56:07,857 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:56:07,857 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:56:07,857 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:56:07,857 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:56:07,857 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:56:07,857 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:56:07,858 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:56:07,858 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:56:07,858 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,858 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,858 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:56:07,858 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:56:07,858 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:56:07,858 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:56:07,859 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:56:07,859 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:56:07,859 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:56:07,860 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:56:07,860 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:56:07,860 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1))) (let ((.cse2 (not .cse1)) (.cse3 (= ~a21~0 1)) (.cse4 (not (= ~a28~0 11))) (.cse0 (= ~a28~0 10)) (.cse6 (= ~a25~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 (or (<= ~a19~0 0) (and .cse2 .cse4))) (and (not (= ~a28~0 8)) (= ~a17~0 8) .cse3 .cse4) (and .cse1 (= ~a28~0 7) .cse6) (and .cse0 .cse6) (and .cse1 .cse6 .cse5)))) [2019-01-12 00:56:07,860 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,860 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,861 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:56:07,861 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:56:07,861 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:56:07,861 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:56:07,861 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:56:07,861 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:56:07,861 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:56:07,861 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,861 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,861 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:56:07,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 544) no Hoare annotation was computed. [2019-01-12 00:56:07,862 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:56:07,862 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:56:07,862 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:56:07,862 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:56:07,862 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:56:07,862 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:56:07,862 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:56:07,862 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:56:07,863 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,863 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,863 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:56:07,863 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:56:07,863 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:56:07,863 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:56:07,863 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:56:07,863 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:56:07,863 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1))) (let ((.cse2 (not .cse1)) (.cse3 (= ~a21~0 1)) (.cse4 (not (= ~a28~0 11))) (.cse0 (= ~a28~0 10)) (.cse6 (= ~a25~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 (or (<= ~a19~0 0) (and .cse2 .cse4))) (and (not (= ~a28~0 8)) (= ~a17~0 8) .cse3 .cse4) (and .cse1 (= ~a28~0 7) .cse6) (and .cse0 .cse6) (and .cse1 .cse6 .cse5)))) [2019-01-12 00:56:07,864 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,864 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,864 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:56:07,864 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:56:07,864 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:56:07,864 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:56:07,864 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:56:07,864 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,864 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,864 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:56:07,865 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:56:07,866 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:56:07,867 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:56:07,868 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:56:07,869 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,869 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,869 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,869 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:56:07,869 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:56:07,869 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:56:07,869 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:56:07,869 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:56:07,869 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,869 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,869 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:07,870 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:56:07,870 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:56:07,870 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:56:07,870 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:56:07,870 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:56:07,870 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:56:07,870 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:56:07,870 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:56:07,870 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:56:07,870 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:56:07,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:56:07 BoogieIcfgContainer [2019-01-12 00:56:07,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:56:07,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:56:07,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:56:07,890 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:56:07,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:52" (3/4) ... [2019-01-12 00:56:07,895 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:56:07,922 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:56:07,924 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:56:08,132 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:56:08,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:56:08,138 INFO L168 Benchmark]: Toolchain (without parser) took 19626.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 379.1 MB). Free memory was 941.9 MB in the beginning and 1.3 GB in the end (delta: -324.7 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:08,138 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:56:08,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.52 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 913.7 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:08,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 160.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 913.7 MB in the beginning and 1.1 GB in the end (delta: -225.1 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:08,141 INFO L168 Benchmark]: Boogie Preprocessor took 61.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:08,142 INFO L168 Benchmark]: RCFGBuilder took 2974.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:08,143 INFO L168 Benchmark]: TraceAbstraction took 15463.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -265.7 MB). Peak memory consumption was 344.3 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:08,144 INFO L168 Benchmark]: Witness Printer took 246.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:08,147 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 713.52 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 913.7 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 160.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 913.7 MB in the beginning and 1.1 GB in the end (delta: -225.1 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2974.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15463.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -265.7 MB). Peak memory consumption was 344.3 MB. Max. memory is 11.5 GB. * Witness Printer took 246.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((a28 == 10 && a19 == 1) || ((!(a19 == 1) && a21 == 1) && !(a28 == 11))) || (!(a11 == 1) && (a19 <= 0 || (!(a19 == 1) && !(a28 == 11))))) || (((!(a28 == 8) && a17 == 8) && a21 == 1) && !(a28 == 11))) || ((a19 == 1 && a28 == 7) && a25 == 1)) || (a28 == 10 && a25 == 1)) || ((a19 == 1 && a25 == 1) && !(a11 == 1)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((a28 == 10 && a19 == 1) || ((!(a19 == 1) && a21 == 1) && !(a28 == 11))) || (!(a11 == 1) && (a19 <= 0 || (!(a19 == 1) && !(a28 == 11))))) || (((!(a28 == 8) && a17 == 8) && a21 == 1) && !(a28 == 11))) || ((a19 == 1 && a28 == 7) && a25 == 1)) || (a28 == 10 && a25 == 1)) || ((a19 == 1 && a25 == 1) && !(a11 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 15.3s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 704 SDtfs, 1882 SDslu, 213 SDs, 0 SdLazy, 4135 SolverSat, 891 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1929occurred in iteration=4, 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 1285 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 163 HoareAnnotationTreeSize, 3 FomulaSimplifications, 900 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 322 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1361 NumberOfCodeBlocks, 1361 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1354 ConstructedInterpolants, 0 QuantifiedInterpolants, 720567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 908/908 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...