./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label14.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/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 9197060d9e6f590900f81f4b5b3ae266edbba8aa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:06:05,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:06:05,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:06:05,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:06:05,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:06:05,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:06:05,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:06:05,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:06:05,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:06:05,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:06:05,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:06:05,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:06:05,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:06:05,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:06:05,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:06:05,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:06:05,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:06:05,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:06:05,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:06:05,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:06:05,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:06:05,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:06:05,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:06:05,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:06:05,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:06:05,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:06:05,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:06:05,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:06:05,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:06:05,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:06:05,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:06:05,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:06:05,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:06:05,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:06:05,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:06:05,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:06:05,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:06:05,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:06:05,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:06:05,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:06:05,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:06:05,416 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:06:05,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:06:05,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:06:05,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:06:05,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:06:05,431 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:06:05,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:06:05,432 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:06:05,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:06:05,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:06:05,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:06:05,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:06:05,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:06:05,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:06:05,433 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:06:05,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:06:05,434 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:06:05,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:06:05,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:06:05,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:06:05,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:06:05,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:06:05,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:06:05,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:06:05,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:06:05,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:06:05,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:06:05,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:06:05,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:06:05,437 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_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/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 -> 9197060d9e6f590900f81f4b5b3ae266edbba8aa [2019-11-16 00:06:05,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:06:05,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:06:05,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:06:05,477 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:06:05,477 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:06:05,478 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label14.c [2019-11-16 00:06:05,530 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/bin/uautomizer/data/383aa74d3/a6b4004a65ba45469bb0baa8b03cb64a/FLAG413dd27b1 [2019-11-16 00:06:06,133 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:06:06,134 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/sv-benchmarks/c/eca-rers2012/Problem03_label14.c [2019-11-16 00:06:06,149 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/bin/uautomizer/data/383aa74d3/a6b4004a65ba45469bb0baa8b03cb64a/FLAG413dd27b1 [2019-11-16 00:06:06,498 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/bin/uautomizer/data/383aa74d3/a6b4004a65ba45469bb0baa8b03cb64a [2019-11-16 00:06:06,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:06:06,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:06:06,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:06,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:06:06,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:06:06,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:06" (1/1) ... [2019-11-16 00:06:06,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c683e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:06, skipping insertion in model container [2019-11-16 00:06:06,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:06" (1/1) ... [2019-11-16 00:06:06,516 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:06:06,586 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:06:07,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:07,223 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:06:07,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:07,462 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:06:07,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07 WrapperNode [2019-11-16 00:06:07,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:07,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:07,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:06:07,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:06:07,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07" (1/1) ... [2019-11-16 00:06:07,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07" (1/1) ... [2019-11-16 00:06:07,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:07,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:06:07,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:06:07,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:06:07,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07" (1/1) ... [2019-11-16 00:06:07,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07" (1/1) ... [2019-11-16 00:06:07,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07" (1/1) ... [2019-11-16 00:06:07,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07" (1/1) ... [2019-11-16 00:06:07,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07" (1/1) ... [2019-11-16 00:06:07,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07" (1/1) ... [2019-11-16 00:06:07,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07" (1/1) ... [2019-11-16 00:06:07,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:06:07,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:06:07,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:06:07,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:06:07,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/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-16 00:06:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:06:07,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:06:09,835 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:06:09,835 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:06:09,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:09 BoogieIcfgContainer [2019-11-16 00:06:09,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:06:09,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:06:09,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:06:09,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:06:09,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:06:06" (1/3) ... [2019-11-16 00:06:09,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65269e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:09, skipping insertion in model container [2019-11-16 00:06:09,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:07" (2/3) ... [2019-11-16 00:06:09,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65269e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:09, skipping insertion in model container [2019-11-16 00:06:09,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:09" (3/3) ... [2019-11-16 00:06:09,847 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label14.c [2019-11-16 00:06:09,856 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:06:09,864 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:06:09,874 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:06:09,910 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:06:09,910 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:06:09,910 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:06:09,910 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:06:09,911 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:06:09,911 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:06:09,911 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:06:09,912 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:06:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-16 00:06:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-16 00:06:09,955 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:09,956 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:09,957 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash 294910218, now seen corresponding path program 1 times [2019-11-16 00:06:09,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:09,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107337842] [2019-11-16 00:06:09,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:09,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:09,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:10,551 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-16 00:06:10,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107337842] [2019-11-16 00:06:10,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:10,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:10,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413037239] [2019-11-16 00:06:10,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:10,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:10,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:10,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:10,573 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-16 00:06:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:12,709 INFO L93 Difference]: Finished difference Result 1068 states and 1913 transitions. [2019-11-16 00:06:12,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:12,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-16 00:06:12,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:12,744 INFO L225 Difference]: With dead ends: 1068 [2019-11-16 00:06:12,744 INFO L226 Difference]: Without dead ends: 670 [2019-11-16 00:06:12,756 INFO L600 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-16 00:06:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-16 00:06:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 456. [2019-11-16 00:06:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-16 00:06:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 704 transitions. [2019-11-16 00:06:12,848 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 704 transitions. Word has length 170 [2019-11-16 00:06:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:12,850 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 704 transitions. [2019-11-16 00:06:12,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 704 transitions. [2019-11-16 00:06:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-16 00:06:12,854 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:12,855 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:12,855 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:12,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:12,856 INFO L82 PathProgramCache]: Analyzing trace with hash -429687334, now seen corresponding path program 1 times [2019-11-16 00:06:12,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:12,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515860130] [2019-11-16 00:06:12,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:12,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:12,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:13,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515860130] [2019-11-16 00:06:13,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:13,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:13,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180744721] [2019-11-16 00:06:13,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:13,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:13,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:13,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:13,023 INFO L87 Difference]: Start difference. First operand 456 states and 704 transitions. Second operand 4 states. [2019-11-16 00:06:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:14,540 INFO L93 Difference]: Finished difference Result 1762 states and 2741 transitions. [2019-11-16 00:06:14,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:14,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-11-16 00:06:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:14,549 INFO L225 Difference]: With dead ends: 1762 [2019-11-16 00:06:14,549 INFO L226 Difference]: Without dead ends: 1308 [2019-11-16 00:06:14,551 INFO L600 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-16 00:06:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-11-16 00:06:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 869. [2019-11-16 00:06:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-11-16 00:06:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1278 transitions. [2019-11-16 00:06:14,590 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1278 transitions. Word has length 175 [2019-11-16 00:06:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:14,591 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1278 transitions. [2019-11-16 00:06:14,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1278 transitions. [2019-11-16 00:06:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-16 00:06:14,595 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:14,596 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:14,596 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:14,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:14,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1109940201, now seen corresponding path program 1 times [2019-11-16 00:06:14,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:14,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341200362] [2019-11-16 00:06:14,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:14,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:14,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:14,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341200362] [2019-11-16 00:06:14,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:14,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:06:14,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695909019] [2019-11-16 00:06:14,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:14,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:14,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:14,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:14,688 INFO L87 Difference]: Start difference. First operand 869 states and 1278 transitions. Second operand 3 states. [2019-11-16 00:06:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:15,682 INFO L93 Difference]: Finished difference Result 2567 states and 3793 transitions. [2019-11-16 00:06:15,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:15,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-11-16 00:06:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:15,697 INFO L225 Difference]: With dead ends: 2567 [2019-11-16 00:06:15,698 INFO L226 Difference]: Without dead ends: 1700 [2019-11-16 00:06:15,699 INFO L600 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-16 00:06:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-11-16 00:06:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1683. [2019-11-16 00:06:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-11-16 00:06:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2433 transitions. [2019-11-16 00:06:15,803 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2433 transitions. Word has length 178 [2019-11-16 00:06:15,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:15,804 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2433 transitions. [2019-11-16 00:06:15,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:15,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2433 transitions. [2019-11-16 00:06:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-16 00:06:15,809 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:15,809 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:15,809 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash 151177408, now seen corresponding path program 1 times [2019-11-16 00:06:15,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:15,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025387033] [2019-11-16 00:06:15,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:15,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:15,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:06:15,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025387033] [2019-11-16 00:06:15,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:15,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:06:15,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325896988] [2019-11-16 00:06:15,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:15,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:15,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:15,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:15,889 INFO L87 Difference]: Start difference. First operand 1683 states and 2433 transitions. Second operand 3 states. [2019-11-16 00:06:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:16,868 INFO L93 Difference]: Finished difference Result 4189 states and 6035 transitions. [2019-11-16 00:06:16,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:16,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-16 00:06:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:16,882 INFO L225 Difference]: With dead ends: 4189 [2019-11-16 00:06:16,882 INFO L226 Difference]: Without dead ends: 2508 [2019-11-16 00:06:16,885 INFO L600 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-16 00:06:16,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-11-16 00:06:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2507. [2019-11-16 00:06:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-11-16 00:06:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3546 transitions. [2019-11-16 00:06:16,945 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3546 transitions. Word has length 185 [2019-11-16 00:06:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:16,946 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 3546 transitions. [2019-11-16 00:06:16,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3546 transitions. [2019-11-16 00:06:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-16 00:06:16,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:16,953 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:16,953 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1497770160, now seen corresponding path program 1 times [2019-11-16 00:06:16,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:16,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419731715] [2019-11-16 00:06:16,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:16,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:16,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:06:17,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419731715] [2019-11-16 00:06:17,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:17,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:06:17,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256332523] [2019-11-16 00:06:17,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:17,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:17,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:17,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:17,067 INFO L87 Difference]: Start difference. First operand 2507 states and 3546 transitions. Second operand 3 states. [2019-11-16 00:06:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:17,395 INFO L93 Difference]: Finished difference Result 7497 states and 10609 transitions. [2019-11-16 00:06:17,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:17,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-11-16 00:06:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:17,425 INFO L225 Difference]: With dead ends: 7497 [2019-11-16 00:06:17,425 INFO L226 Difference]: Without dead ends: 4992 [2019-11-16 00:06:17,429 INFO L600 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-16 00:06:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2019-11-16 00:06:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4989. [2019-11-16 00:06:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-11-16 00:06:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 7044 transitions. [2019-11-16 00:06:17,530 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 7044 transitions. Word has length 190 [2019-11-16 00:06:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:17,531 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 7044 transitions. [2019-11-16 00:06:17,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 7044 transitions. [2019-11-16 00:06:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-16 00:06:17,540 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:17,541 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:17,541 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1140931236, now seen corresponding path program 1 times [2019-11-16 00:06:17,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:17,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542658581] [2019-11-16 00:06:17,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:17,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:17,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:06:17,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542658581] [2019-11-16 00:06:17,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688031669] [2019-11-16 00:06:17,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/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-16 00:06:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:17,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:17,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-16 00:06:17,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:06:17,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-16 00:06:17,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141690287] [2019-11-16 00:06:17,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:17,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:17,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:17,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:17,906 INFO L87 Difference]: Start difference. First operand 4989 states and 7044 transitions. Second operand 3 states. [2019-11-16 00:06:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:18,206 INFO L93 Difference]: Finished difference Result 14957 states and 21122 transitions. [2019-11-16 00:06:18,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:18,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-11-16 00:06:18,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:18,251 INFO L225 Difference]: With dead ends: 14957 [2019-11-16 00:06:18,251 INFO L226 Difference]: Without dead ends: 9970 [2019-11-16 00:06:18,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 199 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-16 00:06:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2019-11-16 00:06:18,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 9968. [2019-11-16 00:06:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9968 states. [2019-11-16 00:06:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14047 transitions. [2019-11-16 00:06:18,471 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14047 transitions. Word has length 199 [2019-11-16 00:06:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:18,472 INFO L462 AbstractCegarLoop]: Abstraction has 9968 states and 14047 transitions. [2019-11-16 00:06:18,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14047 transitions. [2019-11-16 00:06:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-16 00:06:18,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:18,488 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:18,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:18,692 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:18,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:18,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2064135474, now seen corresponding path program 1 times [2019-11-16 00:06:18,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:18,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473507800] [2019-11-16 00:06:18,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:18,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:18,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:18,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473507800] [2019-11-16 00:06:18,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:18,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:18,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674601471] [2019-11-16 00:06:18,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:18,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:18,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:18,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:18,866 INFO L87 Difference]: Start difference. First operand 9968 states and 14047 transitions. Second operand 5 states. [2019-11-16 00:06:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:20,607 INFO L93 Difference]: Finished difference Result 22448 states and 31892 transitions. [2019-11-16 00:06:20,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:20,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-11-16 00:06:20,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:20,666 INFO L225 Difference]: With dead ends: 22448 [2019-11-16 00:06:20,667 INFO L226 Difference]: Without dead ends: 12482 [2019-11-16 00:06:20,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12482 states. [2019-11-16 00:06:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12482 to 10780. [2019-11-16 00:06:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-16 00:06:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 15197 transitions. [2019-11-16 00:06:20,953 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 15197 transitions. Word has length 208 [2019-11-16 00:06:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:20,954 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 15197 transitions. [2019-11-16 00:06:20,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 15197 transitions. [2019-11-16 00:06:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-16 00:06:20,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:20,971 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:20,971 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:20,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:20,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1228512291, now seen corresponding path program 1 times [2019-11-16 00:06:20,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:20,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259485059] [2019-11-16 00:06:20,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:20,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:20,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:06:21,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259485059] [2019-11-16 00:06:21,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:21,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:21,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977968613] [2019-11-16 00:06:21,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:21,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:21,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:21,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:21,083 INFO L87 Difference]: Start difference. First operand 10780 states and 15197 transitions. Second operand 3 states. [2019-11-16 00:06:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:21,948 INFO L93 Difference]: Finished difference Result 21582 states and 30438 transitions. [2019-11-16 00:06:21,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:21,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-11-16 00:06:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:21,970 INFO L225 Difference]: With dead ends: 21582 [2019-11-16 00:06:21,970 INFO L226 Difference]: Without dead ends: 10804 [2019-11-16 00:06:21,980 INFO L600 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-16 00:06:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2019-11-16 00:06:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 10780. [2019-11-16 00:06:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-16 00:06:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 14411 transitions. [2019-11-16 00:06:22,115 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 14411 transitions. Word has length 208 [2019-11-16 00:06:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:22,116 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 14411 transitions. [2019-11-16 00:06:22,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 14411 transitions. [2019-11-16 00:06:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-16 00:06:22,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:22,133 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:22,133 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash 703981814, now seen corresponding path program 1 times [2019-11-16 00:06:22,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:22,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750822564] [2019-11-16 00:06:22,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:22,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:22,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-16 00:06:22,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750822564] [2019-11-16 00:06:22,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:22,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:22,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031144789] [2019-11-16 00:06:22,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:22,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:22,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:22,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:22,223 INFO L87 Difference]: Start difference. First operand 10780 states and 14411 transitions. Second operand 4 states. [2019-11-16 00:06:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:23,756 INFO L93 Difference]: Finished difference Result 39484 states and 52680 transitions. [2019-11-16 00:06:23,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:23,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-16 00:06:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:23,813 INFO L225 Difference]: With dead ends: 39484 [2019-11-16 00:06:23,813 INFO L226 Difference]: Without dead ends: 28706 [2019-11-16 00:06:23,825 INFO L600 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-16 00:06:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28706 states. [2019-11-16 00:06:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28706 to 20132. [2019-11-16 00:06:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20132 states. [2019-11-16 00:06:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 26029 transitions. [2019-11-16 00:06:24,113 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 26029 transitions. Word has length 208 [2019-11-16 00:06:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:24,113 INFO L462 AbstractCegarLoop]: Abstraction has 20132 states and 26029 transitions. [2019-11-16 00:06:24,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 26029 transitions. [2019-11-16 00:06:24,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-16 00:06:24,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:24,138 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:24,138 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:24,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:24,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1211626453, now seen corresponding path program 1 times [2019-11-16 00:06:24,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:24,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759241057] [2019-11-16 00:06:24,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:24,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:24,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-16 00:06:24,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759241057] [2019-11-16 00:06:24,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:24,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:24,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674523638] [2019-11-16 00:06:24,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:24,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:24,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:24,229 INFO L87 Difference]: Start difference. First operand 20132 states and 26029 transitions. Second operand 3 states. [2019-11-16 00:06:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:25,271 INFO L93 Difference]: Finished difference Result 55495 states and 71447 transitions. [2019-11-16 00:06:25,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:25,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-11-16 00:06:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:25,309 INFO L225 Difference]: With dead ends: 55495 [2019-11-16 00:06:25,310 INFO L226 Difference]: Without dead ends: 35365 [2019-11-16 00:06:25,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35365 states. [2019-11-16 00:06:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35365 to 35357. [2019-11-16 00:06:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35357 states. [2019-11-16 00:06:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35357 states to 35357 states and 41642 transitions. [2019-11-16 00:06:25,724 INFO L78 Accepts]: Start accepts. Automaton has 35357 states and 41642 transitions. Word has length 214 [2019-11-16 00:06:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:25,724 INFO L462 AbstractCegarLoop]: Abstraction has 35357 states and 41642 transitions. [2019-11-16 00:06:25,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 35357 states and 41642 transitions. [2019-11-16 00:06:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-16 00:06:25,753 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:25,753 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:25,754 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash -155694673, now seen corresponding path program 1 times [2019-11-16 00:06:25,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:25,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434468604] [2019-11-16 00:06:25,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:25,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:25,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:25,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434468604] [2019-11-16 00:06:25,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:25,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:25,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424778584] [2019-11-16 00:06:25,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:25,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:25,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:25,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:25,906 INFO L87 Difference]: Start difference. First operand 35357 states and 41642 transitions. Second operand 4 states. [2019-11-16 00:06:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:27,665 INFO L93 Difference]: Finished difference Result 83915 states and 100071 transitions. [2019-11-16 00:06:27,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:27,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-11-16 00:06:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:27,718 INFO L225 Difference]: With dead ends: 83915 [2019-11-16 00:06:27,718 INFO L226 Difference]: Without dead ends: 48560 [2019-11-16 00:06:27,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48560 states. [2019-11-16 00:06:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48560 to 48552. [2019-11-16 00:06:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48552 states. [2019-11-16 00:06:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48552 states to 48552 states and 55755 transitions. [2019-11-16 00:06:28,230 INFO L78 Accepts]: Start accepts. Automaton has 48552 states and 55755 transitions. Word has length 225 [2019-11-16 00:06:28,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:28,230 INFO L462 AbstractCegarLoop]: Abstraction has 48552 states and 55755 transitions. [2019-11-16 00:06:28,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 48552 states and 55755 transitions. [2019-11-16 00:06:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-16 00:06:28,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:28,248 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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-16 00:06:28,248 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:28,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:28,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1528433560, now seen corresponding path program 1 times [2019-11-16 00:06:28,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:28,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115651819] [2019-11-16 00:06:28,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:28,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:28,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-16 00:06:28,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115651819] [2019-11-16 00:06:28,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:28,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:06:28,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141556784] [2019-11-16 00:06:28,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:28,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:28,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:28,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:28,384 INFO L87 Difference]: Start difference. First operand 48552 states and 55755 transitions. Second operand 3 states. [2019-11-16 00:06:29,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:29,312 INFO L93 Difference]: Finished difference Result 96192 states and 110400 transitions. [2019-11-16 00:06:29,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:29,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-11-16 00:06:29,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:29,348 INFO L225 Difference]: With dead ends: 96192 [2019-11-16 00:06:29,348 INFO L226 Difference]: Without dead ends: 47642 [2019-11-16 00:06:29,365 INFO L600 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-16 00:06:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47642 states. [2019-11-16 00:06:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47642 to 47642. [2019-11-16 00:06:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47642 states. [2019-11-16 00:06:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47642 states to 47642 states and 54147 transitions. [2019-11-16 00:06:29,770 INFO L78 Accepts]: Start accepts. Automaton has 47642 states and 54147 transitions. Word has length 257 [2019-11-16 00:06:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:29,770 INFO L462 AbstractCegarLoop]: Abstraction has 47642 states and 54147 transitions. [2019-11-16 00:06:29,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 47642 states and 54147 transitions. [2019-11-16 00:06:29,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-16 00:06:29,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:29,783 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:29,784 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:29,784 INFO L82 PathProgramCache]: Analyzing trace with hash 503909962, now seen corresponding path program 1 times [2019-11-16 00:06:29,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:29,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950954599] [2019-11-16 00:06:29,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:29,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:29,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-16 00:06:29,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950954599] [2019-11-16 00:06:29,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:29,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:29,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42284565] [2019-11-16 00:06:29,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:29,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:29,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:29,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:29,990 INFO L87 Difference]: Start difference. First operand 47642 states and 54147 transitions. Second operand 4 states. [2019-11-16 00:06:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:31,311 INFO L93 Difference]: Finished difference Result 130676 states and 148943 transitions. [2019-11-16 00:06:31,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:31,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-11-16 00:06:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:31,376 INFO L225 Difference]: With dead ends: 130676 [2019-11-16 00:06:31,376 INFO L226 Difference]: Without dead ends: 83036 [2019-11-16 00:06:31,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83036 states. [2019-11-16 00:06:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83036 to 60228. [2019-11-16 00:06:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60228 states. [2019-11-16 00:06:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60228 states to 60228 states and 69019 transitions. [2019-11-16 00:06:32,536 INFO L78 Accepts]: Start accepts. Automaton has 60228 states and 69019 transitions. Word has length 300 [2019-11-16 00:06:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:32,549 INFO L462 AbstractCegarLoop]: Abstraction has 60228 states and 69019 transitions. [2019-11-16 00:06:32,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 60228 states and 69019 transitions. [2019-11-16 00:06:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-16 00:06:32,596 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:32,597 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-16 00:06:32,597 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:32,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1954295262, now seen corresponding path program 1 times [2019-11-16 00:06:32,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:32,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169055466] [2019-11-16 00:06:32,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:32,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:32,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-16 00:06:32,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169055466] [2019-11-16 00:06:32,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:32,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:32,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7929606] [2019-11-16 00:06:32,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:32,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:32,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:32,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:32,816 INFO L87 Difference]: Start difference. First operand 60228 states and 69019 transitions. Second operand 4 states. [2019-11-16 00:06:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:34,183 INFO L93 Difference]: Finished difference Result 122098 states and 139839 transitions. [2019-11-16 00:06:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:34,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-11-16 00:06:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:34,234 INFO L225 Difference]: With dead ends: 122098 [2019-11-16 00:06:34,234 INFO L226 Difference]: Without dead ends: 61872 [2019-11-16 00:06:34,255 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-16 00:06:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61872 states. [2019-11-16 00:06:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61872 to 60634. [2019-11-16 00:06:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60634 states. [2019-11-16 00:06:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60634 states to 60634 states and 69259 transitions. [2019-11-16 00:06:35,347 INFO L78 Accepts]: Start accepts. Automaton has 60634 states and 69259 transitions. Word has length 310 [2019-11-16 00:06:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:35,348 INFO L462 AbstractCegarLoop]: Abstraction has 60634 states and 69259 transitions. [2019-11-16 00:06:35,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 60634 states and 69259 transitions. [2019-11-16 00:06:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-11-16 00:06:35,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:35,372 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:06:35,372 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:35,373 INFO L82 PathProgramCache]: Analyzing trace with hash 950105946, now seen corresponding path program 1 times [2019-11-16 00:06:35,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:35,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427505785] [2019-11-16 00:06:35,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:35,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427505785] [2019-11-16 00:06:35,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:35,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:35,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341297629] [2019-11-16 00:06:35,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:35,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:35,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:35,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:35,600 INFO L87 Difference]: Start difference. First operand 60634 states and 69259 transitions. Second operand 4 states. [2019-11-16 00:06:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:36,594 INFO L93 Difference]: Finished difference Result 226045 states and 258441 transitions. [2019-11-16 00:06:36,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:36,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-11-16 00:06:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:36,732 INFO L225 Difference]: With dead ends: 226045 [2019-11-16 00:06:36,732 INFO L226 Difference]: Without dead ends: 165413 [2019-11-16 00:06:36,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165413 states. [2019-11-16 00:06:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165413 to 111281. [2019-11-16 00:06:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111281 states. [2019-11-16 00:06:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111281 states to 111281 states and 127306 transitions. [2019-11-16 00:06:41,825 INFO L78 Accepts]: Start accepts. Automaton has 111281 states and 127306 transitions. Word has length 311 [2019-11-16 00:06:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:41,825 INFO L462 AbstractCegarLoop]: Abstraction has 111281 states and 127306 transitions. [2019-11-16 00:06:41,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 111281 states and 127306 transitions. [2019-11-16 00:06:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-16 00:06:41,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:41,847 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:41,847 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:41,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:41,848 INFO L82 PathProgramCache]: Analyzing trace with hash -63783409, now seen corresponding path program 1 times [2019-11-16 00:06:41,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:41,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436445511] [2019-11-16 00:06:41,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:41,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:41,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-16 00:06:41,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436445511] [2019-11-16 00:06:41,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:41,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:41,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140135021] [2019-11-16 00:06:41,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:41,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:41,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:41,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:41,989 INFO L87 Difference]: Start difference. First operand 111281 states and 127306 transitions. Second operand 4 states. [2019-11-16 00:06:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:43,463 INFO L93 Difference]: Finished difference Result 318454 states and 362660 transitions. [2019-11-16 00:06:43,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:43,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2019-11-16 00:06:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:43,664 INFO L225 Difference]: With dead ends: 318454 [2019-11-16 00:06:43,664 INFO L226 Difference]: Without dead ends: 207175 [2019-11-16 00:06:43,715 INFO L600 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-16 00:06:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207175 states. [2019-11-16 00:06:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207175 to 207165. [2019-11-16 00:06:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207165 states. [2019-11-16 00:06:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207165 states to 207165 states and 235173 transitions. [2019-11-16 00:06:46,121 INFO L78 Accepts]: Start accepts. Automaton has 207165 states and 235173 transitions. Word has length 315 [2019-11-16 00:06:46,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:46,121 INFO L462 AbstractCegarLoop]: Abstraction has 207165 states and 235173 transitions. [2019-11-16 00:06:46,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 207165 states and 235173 transitions. [2019-11-16 00:06:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-11-16 00:06:46,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:46,148 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:06:46,148 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:46,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1376081344, now seen corresponding path program 1 times [2019-11-16 00:06:46,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:46,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243947194] [2019-11-16 00:06:46,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:46,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:46,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:06:46,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243947194] [2019-11-16 00:06:46,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:46,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:46,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338763493] [2019-11-16 00:06:46,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:46,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:46,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:46,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:46,390 INFO L87 Difference]: Start difference. First operand 207165 states and 235173 transitions. Second operand 3 states. [2019-11-16 00:06:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:48,038 INFO L93 Difference]: Finished difference Result 419067 states and 474662 transitions. [2019-11-16 00:06:48,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:48,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-11-16 00:06:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:48,249 INFO L225 Difference]: With dead ends: 419067 [2019-11-16 00:06:48,249 INFO L226 Difference]: Without dead ends: 211904 [2019-11-16 00:06:48,318 INFO L600 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-16 00:06:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211904 states. [2019-11-16 00:06:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211904 to 211834. [2019-11-16 00:06:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211834 states. [2019-11-16 00:06:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211834 states to 211834 states and 236510 transitions. [2019-11-16 00:06:51,430 INFO L78 Accepts]: Start accepts. Automaton has 211834 states and 236510 transitions. Word has length 317 [2019-11-16 00:06:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:51,431 INFO L462 AbstractCegarLoop]: Abstraction has 211834 states and 236510 transitions. [2019-11-16 00:06:51,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 211834 states and 236510 transitions. [2019-11-16 00:06:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-16 00:06:51,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:51,457 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:51,458 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:51,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2095705146, now seen corresponding path program 1 times [2019-11-16 00:06:51,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:51,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922067080] [2019-11-16 00:06:51,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:51,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:51,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:51,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922067080] [2019-11-16 00:06:51,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:51,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:51,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746878825] [2019-11-16 00:06:51,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:51,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:51,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:51,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:51,670 INFO L87 Difference]: Start difference. First operand 211834 states and 236510 transitions. Second operand 3 states. [2019-11-16 00:06:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:53,267 INFO L93 Difference]: Finished difference Result 429410 states and 480031 transitions. [2019-11-16 00:06:53,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:53,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-16 00:06:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:53,483 INFO L225 Difference]: With dead ends: 429410 [2019-11-16 00:06:53,483 INFO L226 Difference]: Without dead ends: 217578 [2019-11-16 00:06:53,555 INFO L600 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-16 00:06:54,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217578 states. [2019-11-16 00:06:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217578 to 217572. [2019-11-16 00:06:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217572 states. [2019-11-16 00:06:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217572 states to 217572 states and 241721 transitions. [2019-11-16 00:06:56,855 INFO L78 Accepts]: Start accepts. Automaton has 217572 states and 241721 transitions. Word has length 321 [2019-11-16 00:06:56,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:56,856 INFO L462 AbstractCegarLoop]: Abstraction has 217572 states and 241721 transitions. [2019-11-16 00:06:56,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 217572 states and 241721 transitions. [2019-11-16 00:06:56,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-11-16 00:06:56,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:56,883 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:56,883 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:56,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:56,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1878310930, now seen corresponding path program 1 times [2019-11-16 00:06:56,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:56,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215230497] [2019-11-16 00:06:56,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:56,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:56,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-16 00:06:57,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215230497] [2019-11-16 00:06:57,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:57,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:57,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746223222] [2019-11-16 00:06:57,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:57,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:57,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:57,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:57,050 INFO L87 Difference]: Start difference. First operand 217572 states and 241721 transitions. Second operand 4 states. [2019-11-16 00:06:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:59,038 INFO L93 Difference]: Finished difference Result 456749 states and 508133 transitions. [2019-11-16 00:06:59,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:59,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-11-16 00:06:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:59,299 INFO L225 Difference]: With dead ends: 456749 [2019-11-16 00:06:59,300 INFO L226 Difference]: Without dead ends: 239179 [2019-11-16 00:06:59,386 INFO L600 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-16 00:06:59,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239179 states. [2019-11-16 00:07:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239179 to 239123. [2019-11-16 00:07:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239123 states. [2019-11-16 00:07:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239123 states to 239123 states and 265256 transitions. [2019-11-16 00:07:02,502 INFO L78 Accepts]: Start accepts. Automaton has 239123 states and 265256 transitions. Word has length 327 [2019-11-16 00:07:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:02,502 INFO L462 AbstractCegarLoop]: Abstraction has 239123 states and 265256 transitions. [2019-11-16 00:07:02,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 239123 states and 265256 transitions. [2019-11-16 00:07:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-16 00:07:02,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:02,545 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:02,545 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:02,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:02,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1148442132, now seen corresponding path program 1 times [2019-11-16 00:07:02,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:02,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785964083] [2019-11-16 00:07:02,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:02,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:02,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-16 00:07:02,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785964083] [2019-11-16 00:07:02,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869724897] [2019-11-16 00:07:02,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/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-16 00:07:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:02,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:07:02,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-16 00:07:02,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:02,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-16 00:07:02,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578147623] [2019-11-16 00:07:02,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:02,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:02,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:02,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:02,955 INFO L87 Difference]: Start difference. First operand 239123 states and 265256 transitions. Second operand 3 states. [2019-11-16 00:07:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:05,380 INFO L93 Difference]: Finished difference Result 471121 states and 522649 transitions. [2019-11-16 00:07:05,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:05,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-11-16 00:07:05,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:05,381 INFO L225 Difference]: With dead ends: 471121 [2019-11-16 00:07:05,381 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:07:05,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:07:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:07:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:07:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:07:05,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2019-11-16 00:07:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:05,453 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:07:05,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:07:05,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:07:05,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:05,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:07:22,133 WARN L191 SmtUtils]: Spent 16.45 s on a formula simplification. DAG size of input: 2181 DAG size of output: 1409 [2019-11-16 00:07:35,022 WARN L191 SmtUtils]: Spent 12.88 s on a formula simplification. DAG size of input: 2181 DAG size of output: 1409 [2019-11-16 00:07:55,589 WARN L191 SmtUtils]: Spent 20.56 s on a formula simplification. DAG size of input: 1304 DAG size of output: 100 [2019-11-16 00:08:15,969 WARN L191 SmtUtils]: Spent 20.37 s on a formula simplification. DAG size of input: 1304 DAG size of output: 100 [2019-11-16 00:08:15,971 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-16 00:08:15,971 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-16 00:08:15,971 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,971 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,971 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,971 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,971 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,971 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,971 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,971 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,972 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,973 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-16 00:08:15,974 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-16 00:08:15,975 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,975 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,975 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,975 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-16 00:08:15,975 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,975 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-16 00:08:15,975 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,975 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,976 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-16 00:08:15,976 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-16 00:08:15,976 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,976 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,976 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,976 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,976 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,976 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,977 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,977 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-16 00:08:15,977 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-16 00:08:15,977 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-16 00:08:15,977 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-16 00:08:15,977 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-16 00:08:15,977 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,977 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,977 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,977 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,978 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,978 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,978 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,978 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,978 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,978 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,978 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-16 00:08:15,978 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-16 00:08:15,982 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-16 00:08:15,982 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,982 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-16 00:08:15,983 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,984 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,985 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,985 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-16 00:08:15,985 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-16 00:08:15,985 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,985 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,985 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,985 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-16 00:08:15,985 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,986 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-16 00:08:15,986 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,986 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-16 00:08:15,986 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,986 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,986 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-16 00:08:15,986 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-16 00:08:15,987 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-16 00:08:15,987 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-16 00:08:15,987 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-16 00:08:15,987 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-16 00:08:15,987 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-16 00:08:15,987 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,987 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,987 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,988 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse2 (= 1 ~a6~0)) (.cse10 (= ~a12~0 1)) (.cse8 (= ~a27~0 1))) (let ((.cse20 (not .cse8)) (.cse7 (not (= 1 ~a11~0))) (.cse12 (= ~a16~0 1)) (.cse4 (= ~a5~0 1)) (.cse21 (not .cse10)) (.cse15 (not .cse2)) (.cse19 (<= ~a20~0 0))) (let ((.cse5 (and .cse4 (and .cse21 .cse8 .cse15 .cse19))) (.cse16 (and .cse21 .cse12)) (.cse17 (= 1 ~a3~0)) (.cse22 (<= ~a27~0 0)) (.cse11 (<= ~a17~0 0)) (.cse0 (<= 2 ~a3~0)) (.cse14 (= ~a26~0 1)) (.cse6 (not (= ~a17~0 1))) (.cse18 (and .cse21 .cse7)) (.cse9 (= ~a29~0 1)) (.cse13 (<= ~a3~0 0)) (.cse1 (and .cse20 .cse12 .cse7)) (.cse3 (<= ~a26~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse9) (and .cse0 .cse8 .cse2 .cse10 .cse11 .cse4 .cse12) (and (and .cse13 .cse4 .cse6) .cse14) (and .cse13 .cse8 .cse4 .cse12 .cse6) (and (and (and .cse8 .cse15 .cse7) .cse3 .cse4 .cse6) .cse0) (and .cse16 .cse17 .cse4 .cse14) (and (and .cse8 .cse18 .cse4 .cse19) .cse6) (and .cse4 .cse14 .cse7) (and .cse17 .cse2 .cse10 .cse3 .cse4 (and .cse20 .cse12)) (and (and .cse18 .cse4 .cse12) .cse8) (and (and .cse21 .cse8 .cse15 .cse12) .cse4) (and .cse5 .cse0) (and .cse0 .cse4 .cse9 .cse14 (and .cse8 .cse15)) (and .cse0 .cse3 .cse4 (and .cse21 .cse15) .cse22) (and .cse11 (and .cse17 (and .cse18 .cse15 .cse19) .cse4) .cse22) (and .cse13 .cse3 .cse4 (and .cse10 .cse15 .cse7) .cse22) (and .cse0 (and .cse18 .cse4)) (and .cse0 .cse8 .cse4 .cse14 .cse12) (and .cse21 .cse17 .cse4 .cse14 .cse19) (and .cse13 .cse10 .cse4 .cse14) (and .cse17 .cse2 .cse10 .cse3 .cse4 .cse7) (and (<= ~a6~0 0) .cse10 .cse4 .cse14 .cse22) (and .cse16 .cse15 .cse4 .cse9 .cse14 .cse22) (and (and .cse4 .cse12 .cse7) .cse0 .cse8 .cse9) (and (and .cse8 .cse4 .cse12 .cse6) .cse14) (and .cse2 (and .cse13 .cse21 .cse8 .cse4 .cse6)) (and (and .cse17 .cse4 (and .cse18 .cse12 .cse22)) .cse11 .cse15) (and .cse21 .cse0 .cse8 .cse2 .cse3 .cse4) (and .cse21 .cse0 .cse4 .cse14) (and .cse21 .cse8 .cse4 .cse14) (and (and .cse13 .cse4 .cse6 .cse19) .cse8) (and (and .cse13 (and .cse21 .cse8 .cse15) .cse4) .cse9) (and (and .cse8 .cse18 .cse4) .cse2 .cse9) (and .cse13 .cse1 .cse10 .cse3 .cse4))))) [2019-11-16 00:08:15,989 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,991 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,991 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,991 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-16 00:08:15,991 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-16 00:08:15,992 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,992 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,992 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:08:15,992 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,992 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-16 00:08:15,992 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,992 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,992 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,993 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,993 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,993 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,993 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-16 00:08:15,993 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-16 00:08:15,993 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,993 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,994 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,994 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,994 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,994 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,995 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,996 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,996 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,996 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-16 00:08:15,996 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-16 00:08:15,996 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,996 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,996 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-16 00:08:15,997 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-16 00:08:15,997 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,997 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse2 (= 1 ~a6~0)) (.cse10 (= ~a12~0 1)) (.cse8 (= ~a27~0 1))) (let ((.cse20 (not .cse8)) (.cse7 (not (= 1 ~a11~0))) (.cse12 (= ~a16~0 1)) (.cse4 (= ~a5~0 1)) (.cse21 (not .cse10)) (.cse15 (not .cse2)) (.cse19 (<= ~a20~0 0))) (let ((.cse5 (and .cse4 (and .cse21 .cse8 .cse15 .cse19))) (.cse16 (and .cse21 .cse12)) (.cse17 (= 1 ~a3~0)) (.cse22 (<= ~a27~0 0)) (.cse11 (<= ~a17~0 0)) (.cse0 (<= 2 ~a3~0)) (.cse14 (= ~a26~0 1)) (.cse6 (not (= ~a17~0 1))) (.cse18 (and .cse21 .cse7)) (.cse9 (= ~a29~0 1)) (.cse13 (<= ~a3~0 0)) (.cse1 (and .cse20 .cse12 .cse7)) (.cse3 (<= ~a26~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse9) (and .cse0 .cse8 .cse2 .cse10 .cse11 .cse4 .cse12) (and (and .cse13 .cse4 .cse6) .cse14) (and .cse13 .cse8 .cse4 .cse12 .cse6) (and (and (and .cse8 .cse15 .cse7) .cse3 .cse4 .cse6) .cse0) (and .cse16 .cse17 .cse4 .cse14) (and (and .cse8 .cse18 .cse4 .cse19) .cse6) (and .cse4 .cse14 .cse7) (and .cse17 .cse2 .cse10 .cse3 .cse4 (and .cse20 .cse12)) (and (and .cse18 .cse4 .cse12) .cse8) (and (and .cse21 .cse8 .cse15 .cse12) .cse4) (and .cse5 .cse0) (and .cse0 .cse4 .cse9 .cse14 (and .cse8 .cse15)) (and .cse0 .cse3 .cse4 (and .cse21 .cse15) .cse22) (and .cse11 (and .cse17 (and .cse18 .cse15 .cse19) .cse4) .cse22) (and .cse13 .cse3 .cse4 (and .cse10 .cse15 .cse7) .cse22) (and .cse0 (and .cse18 .cse4)) (and .cse0 .cse8 .cse4 .cse14 .cse12) (and .cse21 .cse17 .cse4 .cse14 .cse19) (and .cse13 .cse10 .cse4 .cse14) (and .cse17 .cse2 .cse10 .cse3 .cse4 .cse7) (and (<= ~a6~0 0) .cse10 .cse4 .cse14 .cse22) (and .cse16 .cse15 .cse4 .cse9 .cse14 .cse22) (and (and .cse4 .cse12 .cse7) .cse0 .cse8 .cse9) (and (and .cse8 .cse4 .cse12 .cse6) .cse14) (and .cse2 (and .cse13 .cse21 .cse8 .cse4 .cse6)) (and (and .cse17 .cse4 (and .cse18 .cse12 .cse22)) .cse11 .cse15) (and .cse21 .cse0 .cse8 .cse2 .cse3 .cse4) (and .cse21 .cse0 .cse4 .cse14) (and .cse21 .cse8 .cse4 .cse14) (and (and .cse13 .cse4 .cse6 .cse19) .cse8) (and (and .cse13 (and .cse21 .cse8 .cse15) .cse4) .cse9) (and (and .cse8 .cse18 .cse4) .cse2 .cse9) (and .cse13 .cse1 .cse10 .cse3 .cse4))))) [2019-11-16 00:08:15,998 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,998 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,998 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,998 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,998 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-16 00:08:15,998 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-16 00:08:15,998 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,999 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,999 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,999 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,999 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,999 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-16 00:08:15,999 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,999 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:15,999 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-16 00:08:16,000 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-16 00:08:16,000 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-16 00:08:16,000 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,000 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-16 00:08:16,000 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,000 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,000 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-16 00:08:16,001 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,001 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,001 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,001 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,001 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,001 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-16 00:08:16,001 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,002 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-16 00:08:16,002 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-16 00:08:16,002 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-16 00:08:16,002 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,002 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,002 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,002 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,003 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,003 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,003 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,003 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,003 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-16 00:08:16,003 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-16 00:08:16,003 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,003 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,004 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-16 00:08:16,004 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-16 00:08:16,004 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-16 00:08:16,004 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,004 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,004 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,004 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,005 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,005 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,005 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,005 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,005 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,005 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,005 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,005 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-16 00:08:16,006 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-16 00:08:16,006 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-16 00:08:16,006 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:08:16,006 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,006 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,006 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,006 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,007 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,007 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,007 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,007 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-16 00:08:16,007 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-16 00:08:16,007 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,007 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-16 00:08:16,008 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-16 00:08:16,009 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-16 00:08:16,009 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,009 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,009 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,009 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,009 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1545) no Hoare annotation was computed. [2019-11-16 00:08:16,010 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,010 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-16 00:08:16,010 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-16 00:08:16,010 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,011 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,011 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,011 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-16 00:08:16,011 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-16 00:08:16,011 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,011 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-16 00:08:16,011 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,011 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,012 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,012 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,012 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,012 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,012 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,012 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,012 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,013 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,013 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:08:16,013 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-16 00:08:16,013 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-16 00:08:16,013 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-16 00:08:16,013 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,013 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-16 00:08:16,013 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-16 00:08:16,013 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,013 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,013 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,014 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,014 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,014 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,014 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,014 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,014 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,014 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-16 00:08:16,014 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-16 00:08:16,014 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-16 00:08:16,014 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,014 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,015 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,015 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,015 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:08:16,015 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,015 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-16 00:08:16,015 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-16 00:08:16,015 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,015 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-16 00:08:16,016 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-16 00:08:16,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:08:16 BoogieIcfgContainer [2019-11-16 00:08:16,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:08:16,054 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:08:16,054 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:08:16,054 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:08:16,055 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:09" (3/4) ... [2019-11-16 00:08:16,058 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:08:16,092 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:08:16,096 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:08:16,325 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a27c3b6e-53b2-4ee0-86b6-bc5af9ff3353/bin/uautomizer/witness.graphml [2019-11-16 00:08:16,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:08:16,327 INFO L168 Benchmark]: Toolchain (without parser) took 129825.52 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 938.1 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 607.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:16,327 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:08:16,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 961.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 938.1 MB in the beginning and 1.0 GB in the end (delta: -110.3 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:16,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:16,328 INFO L168 Benchmark]: Boogie Preprocessor took 106.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:16,328 INFO L168 Benchmark]: RCFGBuilder took 2140.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -178.7 MB). Peak memory consumption was 265.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:16,329 INFO L168 Benchmark]: TraceAbstraction took 126214.84 ms. Allocated memory was 1.3 GB in the beginning and 5.4 GB in the end (delta: 4.1 GB). Free memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: -3.5 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2019-11-16 00:08:16,329 INFO L168 Benchmark]: Witness Printer took 271.47 ms. Allocated memory is still 5.4 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 79.0 MB). Peak memory consumption was 79.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:16,331 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 961.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 938.1 MB in the beginning and 1.0 GB in the end (delta: -110.3 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 124.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2140.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -178.7 MB). Peak memory consumption was 265.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 126214.84 ms. Allocated memory was 1.3 GB in the beginning and 5.4 GB in the end (delta: 4.1 GB). Free memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: -3.5 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. * Witness Printer took 271.47 ms. Allocated memory is still 5.4 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 79.0 MB). Peak memory consumption was 79.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1545]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((2 <= a3 && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && 1 == a6) && a26 <= 0) && a5 == 1) || ((a5 == 1 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a20 <= 0) && !(a17 == 1))) || (((((!(1 == a11) && 2 <= a3) && a27 == 1) && a26 <= 0) && a5 == 1) && a29 == 1)) || ((((((2 <= a3 && a27 == 1) && 1 == a6) && a12 == 1) && a17 <= 0) && a5 == 1) && a16 == 1)) || (((a3 <= 0 && a5 == 1) && !(a17 == 1)) && a26 == 1)) || ((((a3 <= 0 && a27 == 1) && a5 == 1) && a16 == 1) && !(a17 == 1))) || ((((((a27 == 1 && !(1 == a6)) && !(1 == a11)) && a26 <= 0) && a5 == 1) && !(a17 == 1)) && 2 <= a3)) || ((((!(a12 == 1) && a16 == 1) && 1 == a3) && a5 == 1) && a26 == 1)) || ((((a27 == 1 && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a20 <= 0) && !(a17 == 1))) || ((a5 == 1 && a26 == 1) && !(1 == a11))) || (((((1 == a3 && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(a27 == 1) && a16 == 1)) || ((((!(a12 == 1) && !(1 == a11)) && a5 == 1) && a16 == 1) && a27 == 1)) || ((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1)) || ((a5 == 1 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a20 <= 0) && 2 <= a3)) || ((((2 <= a3 && a5 == 1) && a29 == 1) && a26 == 1) && a27 == 1 && !(1 == a6))) || ((((2 <= a3 && a26 <= 0) && a5 == 1) && !(a12 == 1) && !(1 == a6)) && a27 <= 0)) || ((a17 <= 0 && (1 == a3 && ((!(a12 == 1) && !(1 == a11)) && !(1 == a6)) && a20 <= 0) && a5 == 1) && a27 <= 0)) || ((((a3 <= 0 && a26 <= 0) && a5 == 1) && (a12 == 1 && !(1 == a6)) && !(1 == a11)) && a27 <= 0)) || (2 <= a3 && (!(a12 == 1) && !(1 == a11)) && a5 == 1)) || ((((2 <= a3 && a27 == 1) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((!(a12 == 1) && 1 == a3) && a5 == 1) && a26 == 1) && a20 <= 0)) || (((a3 <= 0 && a12 == 1) && a5 == 1) && a26 == 1)) || (((((1 == a3 && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11))) || ((((a6 <= 0 && a12 == 1) && a5 == 1) && a26 == 1) && a27 <= 0)) || ((((((!(a12 == 1) && a16 == 1) && !(1 == a6)) && a5 == 1) && a29 == 1) && a26 == 1) && a27 <= 0)) || (((((a5 == 1 && a16 == 1) && !(1 == a11)) && 2 <= a3) && a27 == 1) && a29 == 1)) || ((((a27 == 1 && a5 == 1) && a16 == 1) && !(a17 == 1)) && a26 == 1)) || (1 == a6 && (((a3 <= 0 && !(a12 == 1)) && a27 == 1) && a5 == 1) && !(a17 == 1))) || ((((1 == a3 && a5 == 1) && ((!(a12 == 1) && !(1 == a11)) && a16 == 1) && a27 <= 0) && a17 <= 0) && !(1 == a6))) || (((((!(a12 == 1) && 2 <= a3) && a27 == 1) && 1 == a6) && a26 <= 0) && a5 == 1)) || (((!(a12 == 1) && 2 <= a3) && a5 == 1) && a26 == 1)) || (((!(a12 == 1) && a27 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a5 == 1) && !(a17 == 1)) && a20 <= 0) && a27 == 1)) || (((a3 <= 0 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a29 == 1)) || ((((a27 == 1 && !(a12 == 1) && !(1 == a11)) && a5 == 1) && 1 == a6) && a29 == 1)) || ((((a3 <= 0 && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && a12 == 1) && a26 <= 0) && a5 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((2 <= a3 && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && 1 == a6) && a26 <= 0) && a5 == 1) || ((a5 == 1 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a20 <= 0) && !(a17 == 1))) || (((((!(1 == a11) && 2 <= a3) && a27 == 1) && a26 <= 0) && a5 == 1) && a29 == 1)) || ((((((2 <= a3 && a27 == 1) && 1 == a6) && a12 == 1) && a17 <= 0) && a5 == 1) && a16 == 1)) || (((a3 <= 0 && a5 == 1) && !(a17 == 1)) && a26 == 1)) || ((((a3 <= 0 && a27 == 1) && a5 == 1) && a16 == 1) && !(a17 == 1))) || ((((((a27 == 1 && !(1 == a6)) && !(1 == a11)) && a26 <= 0) && a5 == 1) && !(a17 == 1)) && 2 <= a3)) || ((((!(a12 == 1) && a16 == 1) && 1 == a3) && a5 == 1) && a26 == 1)) || ((((a27 == 1 && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a20 <= 0) && !(a17 == 1))) || ((a5 == 1 && a26 == 1) && !(1 == a11))) || (((((1 == a3 && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(a27 == 1) && a16 == 1)) || ((((!(a12 == 1) && !(1 == a11)) && a5 == 1) && a16 == 1) && a27 == 1)) || ((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1)) || ((a5 == 1 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a20 <= 0) && 2 <= a3)) || ((((2 <= a3 && a5 == 1) && a29 == 1) && a26 == 1) && a27 == 1 && !(1 == a6))) || ((((2 <= a3 && a26 <= 0) && a5 == 1) && !(a12 == 1) && !(1 == a6)) && a27 <= 0)) || ((a17 <= 0 && (1 == a3 && ((!(a12 == 1) && !(1 == a11)) && !(1 == a6)) && a20 <= 0) && a5 == 1) && a27 <= 0)) || ((((a3 <= 0 && a26 <= 0) && a5 == 1) && (a12 == 1 && !(1 == a6)) && !(1 == a11)) && a27 <= 0)) || (2 <= a3 && (!(a12 == 1) && !(1 == a11)) && a5 == 1)) || ((((2 <= a3 && a27 == 1) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((!(a12 == 1) && 1 == a3) && a5 == 1) && a26 == 1) && a20 <= 0)) || (((a3 <= 0 && a12 == 1) && a5 == 1) && a26 == 1)) || (((((1 == a3 && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11))) || ((((a6 <= 0 && a12 == 1) && a5 == 1) && a26 == 1) && a27 <= 0)) || ((((((!(a12 == 1) && a16 == 1) && !(1 == a6)) && a5 == 1) && a29 == 1) && a26 == 1) && a27 <= 0)) || (((((a5 == 1 && a16 == 1) && !(1 == a11)) && 2 <= a3) && a27 == 1) && a29 == 1)) || ((((a27 == 1 && a5 == 1) && a16 == 1) && !(a17 == 1)) && a26 == 1)) || (1 == a6 && (((a3 <= 0 && !(a12 == 1)) && a27 == 1) && a5 == 1) && !(a17 == 1))) || ((((1 == a3 && a5 == 1) && ((!(a12 == 1) && !(1 == a11)) && a16 == 1) && a27 <= 0) && a17 <= 0) && !(1 == a6))) || (((((!(a12 == 1) && 2 <= a3) && a27 == 1) && 1 == a6) && a26 <= 0) && a5 == 1)) || (((!(a12 == 1) && 2 <= a3) && a5 == 1) && a26 == 1)) || (((!(a12 == 1) && a27 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a5 == 1) && !(a17 == 1)) && a20 <= 0) && a27 == 1)) || (((a3 <= 0 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a29 == 1)) || ((((a27 == 1 && !(a12 == 1) && !(1 == a11)) && a5 == 1) && 1 == a6) && a29 == 1)) || ((((a3 <= 0 && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && a12 == 1) && a26 <= 0) && a5 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 126.1s, OverallIterations: 20, TraceHistogramMax: 5, AutomataDifference: 29.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 70.3s, HoareTripleCheckerStatistics: 4240 SDtfs, 8115 SDslu, 2104 SDs, 0 SdLazy, 14309 SolverSat, 2555 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 555 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239123occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 89312 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 2094 NumberOfFragments, 1485 HoareAnnotationTreeSize, 3 FomulaSimplifications, 86388 FormulaSimplificationTreeSizeReduction, 29.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 172502 FormulaSimplificationTreeSizeReductionInter, 40.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 5483 NumberOfCodeBlocks, 5483 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5461 ConstructedInterpolants, 0 QuantifiedInterpolants, 2575120 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1030 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 2520/2531 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...