./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label12.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer --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 14ae8eb2d33b1f0bf446cd99369ade126e9422a8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:52:32,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:32,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:32,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:32,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:32,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:32,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:32,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:32,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:32,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:32,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:32,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:32,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:32,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:32,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:32,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:32,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:32,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:32,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:32,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:32,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:32,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:32,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:32,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:32,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:32,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:32,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:32,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:32,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:32,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:32,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:32,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:32,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:32,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:32,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:32,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:32,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:32,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:32,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:32,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:32,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:32,487 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:52:32,503 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:32,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:32,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:32,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:32,505 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:32,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:32,505 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:32,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:52:32,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:32,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:32,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:52:32,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:52:32,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:52:32,506 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:32,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:32,507 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:32,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:52:32,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:32,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:32,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:52:32,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:52:32,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:32,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:32,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:52:32,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:52:32,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:52:32,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:52:32,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:52:32,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer 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 -> 14ae8eb2d33b1f0bf446cd99369ade126e9422a8 [2019-11-25 08:52:32,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:32,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:32,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:32,658 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:32,658 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:32,659 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label12.c [2019-11-25 08:52:32,726 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/data/b36bcaa67/61060b2c87204eae9013d1ddaf5e4e87/FLAG4bdeb04f0 [2019-11-25 08:52:33,218 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:33,218 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/sv-benchmarks/c/eca-rers2012/Problem01_label12.c [2019-11-25 08:52:33,228 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/data/b36bcaa67/61060b2c87204eae9013d1ddaf5e4e87/FLAG4bdeb04f0 [2019-11-25 08:52:33,546 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/data/b36bcaa67/61060b2c87204eae9013d1ddaf5e4e87 [2019-11-25 08:52:33,548 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:33,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:33,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:33,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:33,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:33,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:33" (1/1) ... [2019-11-25 08:52:33,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402af06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:33, skipping insertion in model container [2019-11-25 08:52:33,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:33" (1/1) ... [2019-11-25 08:52:33,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:33,604 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:34,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:34,038 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:52:34,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:34,197 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:52:34,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34 WrapperNode [2019-11-25 08:52:34,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:34,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:34,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:52:34,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:52:34,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34" (1/1) ... [2019-11-25 08:52:34,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34" (1/1) ... [2019-11-25 08:52:34,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:34,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:52:34,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:52:34,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:52:34,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34" (1/1) ... [2019-11-25 08:52:34,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34" (1/1) ... [2019-11-25 08:52:34,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34" (1/1) ... [2019-11-25 08:52:34,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34" (1/1) ... [2019-11-25 08:52:34,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34" (1/1) ... [2019-11-25 08:52:34,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34" (1/1) ... [2019-11-25 08:52:34,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34" (1/1) ... [2019-11-25 08:52:34,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:52:34,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:52:34,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:52:34,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:52:34,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:34,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:52:34,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:52:35,538 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:52:35,539 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:52:35,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:35 BoogieIcfgContainer [2019-11-25 08:52:35,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:52:35,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:52:35,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:52:35,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:52:35,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:52:33" (1/3) ... [2019-11-25 08:52:35,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2d96eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:35, skipping insertion in model container [2019-11-25 08:52:35,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:34" (2/3) ... [2019-11-25 08:52:35,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2d96eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:35, skipping insertion in model container [2019-11-25 08:52:35,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:35" (3/3) ... [2019-11-25 08:52:35,552 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label12.c [2019-11-25 08:52:35,560 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:52:35,568 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:52:35,577 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:52:35,616 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:52:35,616 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:52:35,616 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:52:35,616 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:52:35,617 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:52:35,617 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:52:35,617 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:52:35,618 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:52:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-25 08:52:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-25 08:52:35,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:35,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:35,662 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:35,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:35,668 INFO L82 PathProgramCache]: Analyzing trace with hash -56899633, now seen corresponding path program 1 times [2019-11-25 08:52:35,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:35,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007108765] [2019-11-25 08:52:35,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:36,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007108765] [2019-11-25 08:52:36,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:36,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:36,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335166148] [2019-11-25 08:52:36,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:36,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:36,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:36,250 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-25 08:52:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:37,655 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2019-11-25 08:52:37,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:37,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-25 08:52:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:37,672 INFO L225 Difference]: With dead ends: 687 [2019-11-25 08:52:37,673 INFO L226 Difference]: Without dead ends: 397 [2019-11-25 08:52:37,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-25 08:52:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-25 08:52:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-25 08:52:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-25 08:52:37,730 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 120 [2019-11-25 08:52:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:37,731 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-25 08:52:37,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-25 08:52:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-25 08:52:37,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:37,734 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:52:37,735 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:37,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:37,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2046521246, now seen corresponding path program 1 times [2019-11-25 08:52:37,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:37,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840865054] [2019-11-25 08:52:37,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:37,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840865054] [2019-11-25 08:52:37,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:37,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:37,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120427489] [2019-11-25 08:52:37,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:37,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:37,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:37,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:37,807 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-25 08:52:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:38,588 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-25 08:52:38,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:38,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-11-25 08:52:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:38,595 INFO L225 Difference]: With dead ends: 1054 [2019-11-25 08:52:38,595 INFO L226 Difference]: Without dead ends: 790 [2019-11-25 08:52:38,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-25 08:52:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-25 08:52:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-25 08:52:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-11-25 08:52:38,670 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 126 [2019-11-25 08:52:38,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:38,671 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-11-25 08:52:38,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-11-25 08:52:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-25 08:52:38,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:38,685 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:52:38,686 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:38,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:38,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1403860126, now seen corresponding path program 1 times [2019-11-25 08:52:38,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:38,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73354213] [2019-11-25 08:52:38,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:38,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73354213] [2019-11-25 08:52:38,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:38,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:38,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529492038] [2019-11-25 08:52:38,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:38,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:38,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:38,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:38,883 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 4 states. [2019-11-25 08:52:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:39,658 INFO L93 Difference]: Finished difference Result 1578 states and 2134 transitions. [2019-11-25 08:52:39,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:39,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-11-25 08:52:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:39,670 INFO L225 Difference]: With dead ends: 1578 [2019-11-25 08:52:39,670 INFO L226 Difference]: Without dead ends: 790 [2019-11-25 08:52:39,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:39,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-25 08:52:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-25 08:52:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-25 08:52:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 994 transitions. [2019-11-25 08:52:39,700 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 994 transitions. Word has length 127 [2019-11-25 08:52:39,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:39,700 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 994 transitions. [2019-11-25 08:52:39,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 994 transitions. [2019-11-25 08:52:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-25 08:52:39,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:39,703 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-25 08:52:39,703 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:39,704 INFO L82 PathProgramCache]: Analyzing trace with hash -401386139, now seen corresponding path program 1 times [2019-11-25 08:52:39,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:39,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939265520] [2019-11-25 08:52:39,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:52:39,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939265520] [2019-11-25 08:52:39,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:39,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:52:39,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016906097] [2019-11-25 08:52:39,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:39,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:39,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:39,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:39,770 INFO L87 Difference]: Start difference. First operand 790 states and 994 transitions. Second operand 3 states. [2019-11-25 08:52:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:40,232 INFO L93 Difference]: Finished difference Result 2102 states and 2630 transitions. [2019-11-25 08:52:40,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:40,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-25 08:52:40,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:40,241 INFO L225 Difference]: With dead ends: 2102 [2019-11-25 08:52:40,241 INFO L226 Difference]: Without dead ends: 1314 [2019-11-25 08:52:40,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-25 08:52:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-25 08:52:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-25 08:52:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1429 transitions. [2019-11-25 08:52:40,277 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1429 transitions. Word has length 138 [2019-11-25 08:52:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:40,278 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1429 transitions. [2019-11-25 08:52:40,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1429 transitions. [2019-11-25 08:52:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-25 08:52:40,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:40,282 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:52:40,282 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:40,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:40,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1268632313, now seen corresponding path program 1 times [2019-11-25 08:52:40,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:40,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092433524] [2019-11-25 08:52:40,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:52:40,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092433524] [2019-11-25 08:52:40,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:40,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:40,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026821768] [2019-11-25 08:52:40,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:40,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:40,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:40,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:40,429 INFO L87 Difference]: Start difference. First operand 1183 states and 1429 transitions. Second operand 4 states. [2019-11-25 08:52:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:41,052 INFO L93 Difference]: Finished difference Result 2500 states and 3010 transitions. [2019-11-25 08:52:41,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:41,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-25 08:52:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:41,059 INFO L225 Difference]: With dead ends: 2500 [2019-11-25 08:52:41,060 INFO L226 Difference]: Without dead ends: 1319 [2019-11-25 08:52:41,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-25 08:52:41,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1314. [2019-11-25 08:52:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-25 08:52:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1566 transitions. [2019-11-25 08:52:41,096 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1566 transitions. Word has length 146 [2019-11-25 08:52:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:41,096 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1566 transitions. [2019-11-25 08:52:41,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1566 transitions. [2019-11-25 08:52:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-25 08:52:41,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:41,100 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:52:41,100 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:41,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:41,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1203929905, now seen corresponding path program 1 times [2019-11-25 08:52:41,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:41,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83272901] [2019-11-25 08:52:41,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:52:41,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83272901] [2019-11-25 08:52:41,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:41,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:41,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956364119] [2019-11-25 08:52:41,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:41,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:41,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:41,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:41,220 INFO L87 Difference]: Start difference. First operand 1314 states and 1566 transitions. Second operand 5 states. [2019-11-25 08:52:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:42,210 INFO L93 Difference]: Finished difference Result 2757 states and 3328 transitions. [2019-11-25 08:52:42,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:42,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-11-25 08:52:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:42,218 INFO L225 Difference]: With dead ends: 2757 [2019-11-25 08:52:42,218 INFO L226 Difference]: Without dead ends: 1576 [2019-11-25 08:52:42,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-25 08:52:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-25 08:52:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-25 08:52:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1859 transitions. [2019-11-25 08:52:42,254 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1859 transitions. Word has length 150 [2019-11-25 08:52:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:42,255 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1859 transitions. [2019-11-25 08:52:42,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1859 transitions. [2019-11-25 08:52:42,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-25 08:52:42,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:42,259 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-25 08:52:42,259 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:42,263 INFO L82 PathProgramCache]: Analyzing trace with hash 290696396, now seen corresponding path program 1 times [2019-11-25 08:52:42,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:42,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098191132] [2019-11-25 08:52:42,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:52:42,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098191132] [2019-11-25 08:52:42,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:42,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:42,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854709217] [2019-11-25 08:52:42,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:42,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:42,321 INFO L87 Difference]: Start difference. First operand 1576 states and 1859 transitions. Second operand 3 states. [2019-11-25 08:52:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:42,688 INFO L93 Difference]: Finished difference Result 3150 states and 3716 transitions. [2019-11-25 08:52:42,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:42,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-25 08:52:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:42,695 INFO L225 Difference]: With dead ends: 3150 [2019-11-25 08:52:42,695 INFO L226 Difference]: Without dead ends: 1576 [2019-11-25 08:52:42,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-25 08:52:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2019-11-25 08:52:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-25 08:52:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1419 transitions. [2019-11-25 08:52:42,724 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1419 transitions. Word has length 153 [2019-11-25 08:52:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:42,725 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1419 transitions. [2019-11-25 08:52:42,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1419 transitions. [2019-11-25 08:52:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-25 08:52:42,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:42,729 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-25 08:52:42,729 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:42,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1555225680, now seen corresponding path program 1 times [2019-11-25 08:52:42,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:42,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424868186] [2019-11-25 08:52:42,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 08:52:42,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424868186] [2019-11-25 08:52:42,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:42,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:52:42,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147818310] [2019-11-25 08:52:42,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:42,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:42,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:42,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:42,809 INFO L87 Difference]: Start difference. First operand 1314 states and 1419 transitions. Second operand 3 states. [2019-11-25 08:52:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:43,233 INFO L93 Difference]: Finished difference Result 3281 states and 3559 transitions. [2019-11-25 08:52:43,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:43,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-25 08:52:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:43,243 INFO L225 Difference]: With dead ends: 3281 [2019-11-25 08:52:43,243 INFO L226 Difference]: Without dead ends: 2100 [2019-11-25 08:52:43,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-25 08:52:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-11-25 08:52:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:52:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1964 transitions. [2019-11-25 08:52:43,281 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1964 transitions. Word has length 168 [2019-11-25 08:52:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:43,281 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1964 transitions. [2019-11-25 08:52:43,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1964 transitions. [2019-11-25 08:52:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-25 08:52:43,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:43,286 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:43,286 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:43,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:43,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1961603004, now seen corresponding path program 1 times [2019-11-25 08:52:43,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:43,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344917199] [2019-11-25 08:52:43,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:52:43,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344917199] [2019-11-25 08:52:43,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688052923] [2019-11-25 08:52:43,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:52:43,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-25 08:52:43,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:52:43,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-25 08:52:43,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406434129] [2019-11-25 08:52:43,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:43,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:43,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:43,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:43,714 INFO L87 Difference]: Start difference. First operand 1838 states and 1964 transitions. Second operand 3 states. [2019-11-25 08:52:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:44,153 INFO L93 Difference]: Finished difference Result 1971 states and 2114 transitions. [2019-11-25 08:52:44,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:44,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-25 08:52:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:44,163 INFO L225 Difference]: With dead ends: 1971 [2019-11-25 08:52:44,163 INFO L226 Difference]: Without dead ends: 1969 [2019-11-25 08:52:44,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-25 08:52:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-25 08:52:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:52:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1963 transitions. [2019-11-25 08:52:44,207 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1963 transitions. Word has length 197 [2019-11-25 08:52:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:44,207 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1963 transitions. [2019-11-25 08:52:44,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1963 transitions. [2019-11-25 08:52:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-25 08:52:44,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:44,213 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:52:44,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:44,426 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:44,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:44,426 INFO L82 PathProgramCache]: Analyzing trace with hash 964757150, now seen corresponding path program 1 times [2019-11-25 08:52:44,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:44,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680985936] [2019-11-25 08:52:44,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:52:44,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680985936] [2019-11-25 08:52:44,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422154328] [2019-11-25 08:52:44,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:52:44,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-25 08:52:44,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:52:44,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-25 08:52:44,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702320475] [2019-11-25 08:52:44,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:44,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:44,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:44,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:44,790 INFO L87 Difference]: Start difference. First operand 1838 states and 1963 transitions. Second operand 3 states. [2019-11-25 08:52:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:45,230 INFO L93 Difference]: Finished difference Result 3936 states and 4208 transitions. [2019-11-25 08:52:45,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:45,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-25 08:52:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:45,241 INFO L225 Difference]: With dead ends: 3936 [2019-11-25 08:52:45,241 INFO L226 Difference]: Without dead ends: 1969 [2019-11-25 08:52:45,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-25 08:52:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-25 08:52:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:52:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1943 transitions. [2019-11-25 08:52:45,277 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1943 transitions. Word has length 213 [2019-11-25 08:52:45,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:45,278 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1943 transitions. [2019-11-25 08:52:45,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1943 transitions. [2019-11-25 08:52:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-25 08:52:45,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:45,283 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-25 08:52:45,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:45,487 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:45,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:45,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1703638970, now seen corresponding path program 1 times [2019-11-25 08:52:45,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:45,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408408735] [2019-11-25 08:52:45,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 140 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:45,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408408735] [2019-11-25 08:52:45,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173097566] [2019-11-25 08:52:45,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:52:46,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-25 08:52:46,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:52:46,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-25 08:52:46,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406883605] [2019-11-25 08:52:46,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:46,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:46,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:46,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:46,152 INFO L87 Difference]: Start difference. First operand 1838 states and 1943 transitions. Second operand 3 states. [2019-11-25 08:52:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:46,586 INFO L93 Difference]: Finished difference Result 3934 states and 4173 transitions. [2019-11-25 08:52:46,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:46,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-25 08:52:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:46,588 INFO L225 Difference]: With dead ends: 3934 [2019-11-25 08:52:46,588 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:52:46,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:52:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:52:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:52:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:52:46,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2019-11-25 08:52:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:46,593 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:52:46,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:52:46,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:52:46,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:46,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:52:47,121 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-11-25 08:52:47,352 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-11-25 08:52:47,355 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-25 08:52:47,355 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-25 08:52:47,355 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,355 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,355 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,355 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,355 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,355 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,355 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-25 08:52:47,355 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,356 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-25 08:52:47,357 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-25 08:52:47,358 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-25 08:52:47,359 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-25 08:52:47,359 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-25 08:52:47,359 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-25 08:52:47,359 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-25 08:52:47,359 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-25 08:52:47,359 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (not (= ~a16~0 5))) (.cse3 (<= ~a17~0 0)) (.cse6 (<= ~a20~0 0)) (.cse0 (= 1 ~a7~0)) (.cse5 (= ~a20~0 1)) (.cse2 (= ~a17~0 1)) (.cse4 (= ~a21~0 1))) (or (and .cse0 .cse1) (and .cse0 (<= ~a21~0 0) .cse2) (and .cse3 .cse4 .cse5) (and .cse2 .cse4 .cse5 .cse1) (and .cse3 .cse6) (and .cse2 .cse4 .cse6) (and .cse0 .cse6) (and (not .cse0) .cse2 (= ~a12~0 8) .cse4 .cse5 (not (= 1 ULTIMATE.start_calculate_output_~input)) (= 15 ~a8~0)) (and (= ~a16~0 4) .cse2 .cse4))) [2019-11-25 08:52:47,359 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,359 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-25 08:52:47,360 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-25 08:52:47,361 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-25 08:52:47,361 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-25 08:52:47,364 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-25 08:52:47,365 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-25 08:52:47,365 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,365 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,365 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,365 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,365 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,366 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-25 08:52:47,366 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-25 08:52:47,366 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-25 08:52:47,366 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-25 08:52:47,366 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-25 08:52:47,366 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-25 08:52:47,366 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-25 08:52:47,366 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-25 08:52:47,367 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-25 08:52:47,367 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,367 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,367 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,367 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,367 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-25 08:52:47,367 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,368 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-25 08:52:47,368 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-25 08:52:47,368 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-25 08:52:47,368 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-25 08:52:47,368 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-25 08:52:47,368 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-25 08:52:47,368 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-25 08:52:47,368 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:52:47,369 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-25 08:52:47,369 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-25 08:52:47,369 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-25 08:52:47,369 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-25 08:52:47,369 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-25 08:52:47,369 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-25 08:52:47,369 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,370 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a20~0 1)) (.cse4 (not (= ~a16~0 5))) (.cse5 (<= ~a17~0 0)) (.cse0 (= 1 ~a7~0)) (.cse6 (<= ~a20~0 0)) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a21~0 1))) (or (and (not .cse0) (= ~a12~0 8) .cse1 .cse2 .cse3 (= 15 ~a8~0)) (and .cse0 .cse4) (and .cse0 (<= ~a21~0 0) .cse1) (and .cse5 .cse2 .cse3) (and .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6) (and .cse1 .cse2 .cse6) (and .cse0 .cse6) (and (= ~a16~0 4) .cse1 .cse2))) [2019-11-25 08:52:47,370 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,370 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,370 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,370 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,370 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-25 08:52:47,371 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-25 08:52:47,371 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-25 08:52:47,371 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-25 08:52:47,371 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-25 08:52:47,371 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-25 08:52:47,371 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-25 08:52:47,371 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-25 08:52:47,371 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,372 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,372 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,372 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,372 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,372 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-25 08:52:47,372 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:52:47,372 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-25 08:52:47,373 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-25 08:52:47,373 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-25 08:52:47,373 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-25 08:52:47,373 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-25 08:52:47,373 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-25 08:52:47,373 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-25 08:52:47,373 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-25 08:52:47,374 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-25 08:52:47,374 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-25 08:52:47,374 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-25 08:52:47,374 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,374 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,374 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,374 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,374 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-25 08:52:47,375 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,375 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,375 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-25 08:52:47,375 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-25 08:52:47,375 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:52:47,375 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-25 08:52:47,375 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-25 08:52:47,375 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-25 08:52:47,376 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-25 08:52:47,376 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-25 08:52:47,376 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-25 08:52:47,376 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-25 08:52:47,376 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-25 08:52:47,376 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-25 08:52:47,376 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-25 08:52:47,377 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,377 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,377 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,377 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,377 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,377 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-25 08:52:47,377 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,377 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-25 08:52:47,378 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-25 08:52:47,378 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-25 08:52:47,378 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-25 08:52:47,378 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-25 08:52:47,378 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-25 08:52:47,378 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-25 08:52:47,378 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-25 08:52:47,378 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-25 08:52:47,379 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-25 08:52:47,379 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-25 08:52:47,379 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:52:47,379 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 536) no Hoare annotation was computed. [2019-11-25 08:52:47,380 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-25 08:52:47,380 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-25 08:52:47,380 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-25 08:52:47,380 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,381 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,381 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,381 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,381 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,381 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:52:47,381 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-25 08:52:47,381 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-25 08:52:47,381 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-25 08:52:47,382 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-25 08:52:47,382 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-25 08:52:47,382 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-25 08:52:47,382 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-25 08:52:47,382 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-25 08:52:47,382 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-25 08:52:47,382 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-25 08:52:47,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:52:47 BoogieIcfgContainer [2019-11-25 08:52:47,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:52:47,419 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:47,419 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:47,420 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:47,420 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:35" (3/4) ... [2019-11-25 08:52:47,423 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:52:47,450 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:52:47,451 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:52:47,644 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fdd88faf-6a50-4ee6-9f6c-3c86d3ff45a1/bin/uautomizer/witness.graphml [2019-11-25 08:52:47,644 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:47,645 INFO L168 Benchmark]: Toolchain (without parser) took 14096.16 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -122.4 MB). Peak memory consumption was 323.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,647 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:47,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -220.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,647 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,649 INFO L168 Benchmark]: Boogie Preprocessor took 77.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,649 INFO L168 Benchmark]: RCFGBuilder took 1193.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,649 INFO L168 Benchmark]: TraceAbstraction took 11877.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 245.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -46.1 MB). Peak memory consumption was 199.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,650 INFO L168 Benchmark]: Witness Printer took 224.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,652 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 648.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -220.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1193.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11877.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 245.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -46.1 MB). Peak memory consumption was 199.3 MB. Max. memory is 11.5 GB. * Witness Printer took 224.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 536]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && !(a16 == 5)) || ((1 == a7 && a21 <= 0) && a17 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || (((a17 == 1 && a21 == 1) && a20 == 1) && !(a16 == 5))) || (a17 <= 0 && a20 <= 0)) || ((a17 == 1 && a21 == 1) && a20 <= 0)) || (1 == a7 && a20 <= 0)) || ((((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) && !(1 == input)) && 15 == a8)) || ((a16 == 4 && a17 == 1) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((!(1 == a7) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1) && 15 == a8) || (1 == a7 && !(a16 == 5))) || ((1 == a7 && a21 <= 0) && a17 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || (((a17 == 1 && a21 == 1) && a20 == 1) && !(a16 == 5))) || (a17 <= 0 && a20 <= 0)) || ((a17 == 1 && a21 == 1) && a20 <= 0)) || (1 == a7 && a20 <= 0)) || ((a16 == 4 && a17 == 1) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.7s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 1145 SDtfs, 1828 SDslu, 105 SDs, 0 SdLazy, 5131 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 636 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 199 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1332 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 710 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2380 NumberOfCodeBlocks, 2380 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2366 ConstructedInterpolants, 0 QuantifiedInterpolants, 1240341 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1092 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 1110/1205 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...