./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/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 d50ba566f02e5109971f6a90ba216a95432a7661 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:58:03,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:58:03,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:58:03,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:58:03,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:58:03,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:58:03,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:58:03,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:58:03,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:58:03,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:58:03,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:58:03,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:58:03,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:58:03,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:58:03,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:58:03,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:58:03,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:58:03,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:58:03,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:58:03,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:58:03,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:58:03,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:58:03,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:58:03,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:58:03,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:58:03,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:58:03,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:58:03,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:58:03,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:58:03,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:58:03,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:58:03,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:58:03,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:58:03,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:58:03,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:58:03,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:58:03,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:58:03,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:58:03,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:58:03,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:58:03,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:58:03,584 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:58:03,609 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:58:03,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:58:03,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:58:03,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:58:03,620 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:58:03,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:58:03,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:58:03,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:58:03,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:58:03,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:58:03,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:58:03,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:58:03,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:58:03,622 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:58:03,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:58:03,623 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:58:03,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:58:03,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:58:03,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:58:03,624 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:58:03,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:58:03,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:58:03,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:58:03,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:58:03,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:58:03,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:58:03,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:58:03,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:58:03,626 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_dff6968d-df43-407a-aeca-5d8db47cac11/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 -> d50ba566f02e5109971f6a90ba216a95432a7661 [2019-11-25 08:58:03,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:58:03,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:58:03,771 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:58:03,773 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:58:03,773 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:58:03,775 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2019-11-25 08:58:03,827 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/data/4c0fa41e9/f7ece671cfe54537baf01e842a8aeafe/FLAG3f92aa68b [2019-11-25 08:58:04,283 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:58:04,283 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2019-11-25 08:58:04,298 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/data/4c0fa41e9/f7ece671cfe54537baf01e842a8aeafe/FLAG3f92aa68b [2019-11-25 08:58:04,547 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/data/4c0fa41e9/f7ece671cfe54537baf01e842a8aeafe [2019-11-25 08:58:04,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:58:04,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:58:04,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:58:04,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:58:04,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:58:04,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:58:04" (1/1) ... [2019-11-25 08:58:04,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d7c1545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:04, skipping insertion in model container [2019-11-25 08:58:04,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:58:04" (1/1) ... [2019-11-25 08:58:04,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:58:04,614 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:58:04,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:58:05,017 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:58:05,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:58:05,124 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:58:05,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05 WrapperNode [2019-11-25 08:58:05,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:58:05,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:58:05,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:58:05,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:58:05,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05" (1/1) ... [2019-11-25 08:58:05,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05" (1/1) ... [2019-11-25 08:58:05,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:58:05,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:58:05,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:58:05,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:58:05,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05" (1/1) ... [2019-11-25 08:58:05,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05" (1/1) ... [2019-11-25 08:58:05,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05" (1/1) ... [2019-11-25 08:58:05,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05" (1/1) ... [2019-11-25 08:58:05,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05" (1/1) ... [2019-11-25 08:58:05,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05" (1/1) ... [2019-11-25 08:58:05,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05" (1/1) ... [2019-11-25 08:58:05,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:58:05,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:58:05,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:58:05,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:58:05,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:58:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:58:05,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:58:06,590 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:58:06,590 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:58:06,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:58:06 BoogieIcfgContainer [2019-11-25 08:58:06,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:58:06,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:58:06,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:58:06,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:58:06,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:58:04" (1/3) ... [2019-11-25 08:58:06,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3723f7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:58:06, skipping insertion in model container [2019-11-25 08:58:06,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:05" (2/3) ... [2019-11-25 08:58:06,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3723f7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:58:06, skipping insertion in model container [2019-11-25 08:58:06,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:58:06" (3/3) ... [2019-11-25 08:58:06,599 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label14.c [2019-11-25 08:58:06,607 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:58:06,614 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:58:06,623 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:58:06,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:58:06,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:58:06,661 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:58:06,661 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:58:06,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:58:06,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:58:06,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:58:06,662 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:58:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-25 08:58:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-25 08:58:06,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:06,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:06,706 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2004563326, now seen corresponding path program 1 times [2019-11-25 08:58:06,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:06,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271533170] [2019-11-25 08:58:06,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:08,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271533170] [2019-11-25 08:58:08,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:08,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 08:58:08,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193919434] [2019-11-25 08:58:08,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:58:08,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:08,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:58:08,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:58:08,094 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-11-25 08:58:08,283 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-11-25 08:58:08,438 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-11-25 08:58:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:09,597 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-11-25 08:58:09,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:58:09,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-11-25 08:58:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:09,610 INFO L225 Difference]: With dead ends: 493 [2019-11-25 08:58:09,610 INFO L226 Difference]: Without dead ends: 193 [2019-11-25 08:58:09,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:58:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-25 08:58:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-25 08:58:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-25 08:58:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-11-25 08:58:09,657 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 131 [2019-11-25 08:58:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:09,658 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-11-25 08:58:09,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:58:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-11-25 08:58:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-25 08:58:09,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:09,661 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:58:09,661 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:09,662 INFO L82 PathProgramCache]: Analyzing trace with hash 481563718, now seen corresponding path program 1 times [2019-11-25 08:58:09,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:09,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25921672] [2019-11-25 08:58:09,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:58:09,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25921672] [2019-11-25 08:58:09,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:09,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:09,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877007345] [2019-11-25 08:58:09,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:09,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:09,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:09,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:09,788 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 3 states. [2019-11-25 08:58:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:10,234 INFO L93 Difference]: Finished difference Result 457 states and 661 transitions. [2019-11-25 08:58:10,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:10,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-11-25 08:58:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:10,238 INFO L225 Difference]: With dead ends: 457 [2019-11-25 08:58:10,238 INFO L226 Difference]: Without dead ends: 324 [2019-11-25 08:58:10,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:10,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-25 08:58:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-11-25 08:58:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-25 08:58:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 443 transitions. [2019-11-25 08:58:10,266 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 443 transitions. Word has length 135 [2019-11-25 08:58:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:10,267 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 443 transitions. [2019-11-25 08:58:10,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 443 transitions. [2019-11-25 08:58:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-25 08:58:10,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:10,271 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-25 08:58:10,271 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:10,272 INFO L82 PathProgramCache]: Analyzing trace with hash -892512546, now seen corresponding path program 1 times [2019-11-25 08:58:10,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:10,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157570259] [2019-11-25 08:58:10,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:58:10,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157570259] [2019-11-25 08:58:10,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:10,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:10,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212043950] [2019-11-25 08:58:10,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:58:10,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:10,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:58:10,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:10,345 INFO L87 Difference]: Start difference. First operand 324 states and 443 transitions. Second operand 4 states. [2019-11-25 08:58:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:10,852 INFO L93 Difference]: Finished difference Result 850 states and 1198 transitions. [2019-11-25 08:58:10,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:10,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-25 08:58:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:10,856 INFO L225 Difference]: With dead ends: 850 [2019-11-25 08:58:10,856 INFO L226 Difference]: Without dead ends: 586 [2019-11-25 08:58:10,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-25 08:58:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-11-25 08:58:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-25 08:58:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 783 transitions. [2019-11-25 08:58:10,880 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 783 transitions. Word has length 140 [2019-11-25 08:58:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:10,880 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 783 transitions. [2019-11-25 08:58:10,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:58:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 783 transitions. [2019-11-25 08:58:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-25 08:58:10,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:10,886 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-25 08:58:10,886 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:10,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash -970300302, now seen corresponding path program 1 times [2019-11-25 08:58:10,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:10,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374022676] [2019-11-25 08:58:10,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:58:10,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374022676] [2019-11-25 08:58:10,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:10,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:10,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145430172] [2019-11-25 08:58:10,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:10,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:10,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:10,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:10,959 INFO L87 Difference]: Start difference. First operand 586 states and 783 transitions. Second operand 3 states. [2019-11-25 08:58:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:11,389 INFO L93 Difference]: Finished difference Result 1243 states and 1680 transitions. [2019-11-25 08:58:11,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:11,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-25 08:58:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:11,393 INFO L225 Difference]: With dead ends: 1243 [2019-11-25 08:58:11,393 INFO L226 Difference]: Without dead ends: 717 [2019-11-25 08:58:11,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-25 08:58:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 586. [2019-11-25 08:58:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-25 08:58:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 777 transitions. [2019-11-25 08:58:11,411 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 777 transitions. Word has length 148 [2019-11-25 08:58:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:11,412 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 777 transitions. [2019-11-25 08:58:11,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 777 transitions. [2019-11-25 08:58:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-25 08:58:11,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:11,416 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:11,417 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:11,417 INFO L82 PathProgramCache]: Analyzing trace with hash -247512496, now seen corresponding path program 1 times [2019-11-25 08:58:11,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:11,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200034999] [2019-11-25 08:58:11,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:58:11,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200034999] [2019-11-25 08:58:11,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:11,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:58:11,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605902143] [2019-11-25 08:58:11,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:58:11,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:11,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:58:11,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:11,474 INFO L87 Difference]: Start difference. First operand 586 states and 777 transitions. Second operand 4 states. [2019-11-25 08:58:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:12,229 INFO L93 Difference]: Finished difference Result 2029 states and 2732 transitions. [2019-11-25 08:58:12,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:58:12,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-25 08:58:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:12,241 INFO L225 Difference]: With dead ends: 2029 [2019-11-25 08:58:12,241 INFO L226 Difference]: Without dead ends: 1503 [2019-11-25 08:58:12,242 INFO L630 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-25 08:58:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-25 08:58:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1372. [2019-11-25 08:58:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-25 08:58:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1768 transitions. [2019-11-25 08:58:12,281 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1768 transitions. Word has length 157 [2019-11-25 08:58:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:12,282 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1768 transitions. [2019-11-25 08:58:12,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:58:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1768 transitions. [2019-11-25 08:58:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-25 08:58:12,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:12,286 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:58:12,286 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:12,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1736300161, now seen corresponding path program 1 times [2019-11-25 08:58:12,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:12,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225468341] [2019-11-25 08:58:12,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:58:12,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225468341] [2019-11-25 08:58:12,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:12,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:58:12,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788528270] [2019-11-25 08:58:12,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:58:12,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:12,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:58:12,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:58:12,388 INFO L87 Difference]: Start difference. First operand 1372 states and 1768 transitions. Second operand 5 states. [2019-11-25 08:58:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:13,396 INFO L93 Difference]: Finished difference Result 2815 states and 3620 transitions. [2019-11-25 08:58:13,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:58:13,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-11-25 08:58:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:13,405 INFO L225 Difference]: With dead ends: 2815 [2019-11-25 08:58:13,406 INFO L226 Difference]: Without dead ends: 1503 [2019-11-25 08:58:13,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:58:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-25 08:58:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-25 08:58:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-25 08:58:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1893 transitions. [2019-11-25 08:58:13,443 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1893 transitions. Word has length 163 [2019-11-25 08:58:13,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:13,445 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1893 transitions. [2019-11-25 08:58:13,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:58:13,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1893 transitions. [2019-11-25 08:58:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-25 08:58:13,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:13,450 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:58:13,453 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:13,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1205837626, now seen corresponding path program 1 times [2019-11-25 08:58:13,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:13,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415485631] [2019-11-25 08:58:13,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:58:13,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415485631] [2019-11-25 08:58:13,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:13,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:13,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497468433] [2019-11-25 08:58:13,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:13,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:13,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:13,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:13,503 INFO L87 Difference]: Start difference. First operand 1503 states and 1893 transitions. Second operand 3 states. [2019-11-25 08:58:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:13,913 INFO L93 Difference]: Finished difference Result 3601 states and 4557 transitions. [2019-11-25 08:58:13,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:13,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-25 08:58:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:13,923 INFO L225 Difference]: With dead ends: 3601 [2019-11-25 08:58:13,924 INFO L226 Difference]: Without dead ends: 1896 [2019-11-25 08:58:13,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-11-25 08:58:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1765. [2019-11-25 08:58:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-25 08:58:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2004 transitions. [2019-11-25 08:58:13,963 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2004 transitions. Word has length 166 [2019-11-25 08:58:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:13,964 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 2004 transitions. [2019-11-25 08:58:13,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2004 transitions. [2019-11-25 08:58:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-25 08:58:13,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:13,969 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:13,969 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1300334530, now seen corresponding path program 1 times [2019-11-25 08:58:13,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:13,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741633791] [2019-11-25 08:58:13,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:14,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741633791] [2019-11-25 08:58:14,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:14,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:58:14,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073415484] [2019-11-25 08:58:14,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:58:14,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:14,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:58:14,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:58:14,070 INFO L87 Difference]: Start difference. First operand 1765 states and 2004 transitions. Second operand 5 states. [2019-11-25 08:58:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:14,978 INFO L93 Difference]: Finished difference Result 4782 states and 5478 transitions. [2019-11-25 08:58:14,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:58:14,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-25 08:58:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:14,991 INFO L225 Difference]: With dead ends: 4782 [2019-11-25 08:58:14,992 INFO L226 Difference]: Without dead ends: 3077 [2019-11-25 08:58:14,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:58:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2019-11-25 08:58:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2682. [2019-11-25 08:58:15,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-11-25 08:58:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2977 transitions. [2019-11-25 08:58:15,053 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2977 transitions. Word has length 181 [2019-11-25 08:58:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:15,053 INFO L462 AbstractCegarLoop]: Abstraction has 2682 states and 2977 transitions. [2019-11-25 08:58:15,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:58:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2977 transitions. [2019-11-25 08:58:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-25 08:58:15,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:15,060 INFO L410 BasicCegarLoop]: trace histogram [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, 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-25 08:58:15,060 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:15,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash 766976078, now seen corresponding path program 1 times [2019-11-25 08:58:15,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:15,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647888638] [2019-11-25 08:58:15,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-25 08:58:15,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647888638] [2019-11-25 08:58:15,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:15,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:58:15,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684290942] [2019-11-25 08:58:15,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:58:15,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:15,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:58:15,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:15,281 INFO L87 Difference]: Start difference. First operand 2682 states and 2977 transitions. Second operand 4 states. [2019-11-25 08:58:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:16,077 INFO L93 Difference]: Finished difference Result 5699 states and 6349 transitions. [2019-11-25 08:58:16,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:58:16,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-25 08:58:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:16,091 INFO L225 Difference]: With dead ends: 5699 [2019-11-25 08:58:16,091 INFO L226 Difference]: Without dead ends: 2946 [2019-11-25 08:58:16,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2019-11-25 08:58:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2682. [2019-11-25 08:58:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-11-25 08:58:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2882 transitions. [2019-11-25 08:58:16,153 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2882 transitions. Word has length 210 [2019-11-25 08:58:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:16,154 INFO L462 AbstractCegarLoop]: Abstraction has 2682 states and 2882 transitions. [2019-11-25 08:58:16,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:58:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2882 transitions. [2019-11-25 08:58:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-25 08:58:16,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:16,161 INFO L410 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, 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] [2019-11-25 08:58:16,161 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:16,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:16,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1931153020, now seen corresponding path program 1 times [2019-11-25 08:58:16,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:16,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281279176] [2019-11-25 08:58:16,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-25 08:58:16,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281279176] [2019-11-25 08:58:16,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:16,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:16,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309592796] [2019-11-25 08:58:16,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:16,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:16,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:16,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:16,375 INFO L87 Difference]: Start difference. First operand 2682 states and 2882 transitions. Second operand 3 states. [2019-11-25 08:58:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:16,730 INFO L93 Difference]: Finished difference Result 5566 states and 5992 transitions. [2019-11-25 08:58:16,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:16,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-25 08:58:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:16,741 INFO L225 Difference]: With dead ends: 5566 [2019-11-25 08:58:16,741 INFO L226 Difference]: Without dead ends: 2682 [2019-11-25 08:58:16,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-11-25 08:58:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2420. [2019-11-25 08:58:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-25 08:58:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 2562 transitions. [2019-11-25 08:58:16,787 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 2562 transitions. Word has length 235 [2019-11-25 08:58:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:16,788 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 2562 transitions. [2019-11-25 08:58:16,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2562 transitions. [2019-11-25 08:58:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-25 08:58:16,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:16,794 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-25 08:58:16,795 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:16,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:16,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1131445953, now seen corresponding path program 1 times [2019-11-25 08:58:16,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:16,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045622369] [2019-11-25 08:58:16,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-25 08:58:16,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045622369] [2019-11-25 08:58:16,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:16,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:58:16,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649319274] [2019-11-25 08:58:16,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:58:16,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:16,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:58:16,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:16,919 INFO L87 Difference]: Start difference. First operand 2420 states and 2562 transitions. Second operand 4 states. [2019-11-25 08:58:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:17,655 INFO L93 Difference]: Finished difference Result 4780 states and 5062 transitions. [2019-11-25 08:58:17,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:58:17,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-11-25 08:58:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:17,662 INFO L225 Difference]: With dead ends: 4780 [2019-11-25 08:58:17,662 INFO L226 Difference]: Without dead ends: 1634 [2019-11-25 08:58:17,665 INFO L630 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-25 08:58:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-11-25 08:58:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1503. [2019-11-25 08:58:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-25 08:58:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1570 transitions. [2019-11-25 08:58:17,694 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1570 transitions. Word has length 237 [2019-11-25 08:58:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:17,695 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1570 transitions. [2019-11-25 08:58:17,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:58:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1570 transitions. [2019-11-25 08:58:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-25 08:58:17,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:17,700 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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-25 08:58:17,700 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:17,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:17,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1941854154, now seen corresponding path program 1 times [2019-11-25 08:58:17,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:17,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312586010] [2019-11-25 08:58:17,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-25 08:58:18,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312586010] [2019-11-25 08:58:18,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:18,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:58:18,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889408495] [2019-11-25 08:58:18,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:58:18,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:18,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:58:18,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:58:18,104 INFO L87 Difference]: Start difference. First operand 1503 states and 1570 transitions. Second operand 5 states. [2019-11-25 08:58:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:18,518 INFO L93 Difference]: Finished difference Result 3023 states and 3163 transitions. [2019-11-25 08:58:18,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:58:18,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2019-11-25 08:58:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:18,525 INFO L225 Difference]: With dead ends: 3023 [2019-11-25 08:58:18,525 INFO L226 Difference]: Without dead ends: 1503 [2019-11-25 08:58:18,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:58:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-25 08:58:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-25 08:58:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-25 08:58:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1567 transitions. [2019-11-25 08:58:18,552 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1567 transitions. Word has length 259 [2019-11-25 08:58:18,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:18,552 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1567 transitions. [2019-11-25 08:58:18,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:58:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1567 transitions. [2019-11-25 08:58:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-25 08:58:18,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:18,559 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:18,559 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1207165551, now seen corresponding path program 1 times [2019-11-25 08:58:18,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:18,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376449763] [2019-11-25 08:58:18,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 215 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-25 08:58:19,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376449763] [2019-11-25 08:58:19,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186234872] [2019-11-25 08:58:19,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:19,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:58:19,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-25 08:58:19,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:58:19,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-25 08:58:19,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184723630] [2019-11-25 08:58:19,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:19,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:19,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:19,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:58:19,899 INFO L87 Difference]: Start difference. First operand 1503 states and 1567 transitions. Second operand 3 states. [2019-11-25 08:58:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:20,254 INFO L93 Difference]: Finished difference Result 1505 states and 1568 transitions. [2019-11-25 08:58:20,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:20,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-11-25 08:58:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:20,262 INFO L225 Difference]: With dead ends: 1505 [2019-11-25 08:58:20,263 INFO L226 Difference]: Without dead ends: 1503 [2019-11-25 08:58:20,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:58:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-25 08:58:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1372. [2019-11-25 08:58:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-25 08:58:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1430 transitions. [2019-11-25 08:58:20,296 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1430 transitions. Word has length 282 [2019-11-25 08:58:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:20,296 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1430 transitions. [2019-11-25 08:58:20,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1430 transitions. [2019-11-25 08:58:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-11-25 08:58:20,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:20,302 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-25 08:58:20,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:20,507 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:20,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1143025436, now seen corresponding path program 1 times [2019-11-25 08:58:20,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:20,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818852895] [2019-11-25 08:58:20,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-25 08:58:20,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818852895] [2019-11-25 08:58:20,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:20,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:58:20,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467209952] [2019-11-25 08:58:20,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:58:20,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:20,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:58:20,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:58:20,970 INFO L87 Difference]: Start difference. First operand 1372 states and 1430 transitions. Second operand 5 states. [2019-11-25 08:58:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:21,510 INFO L93 Difference]: Finished difference Result 2631 states and 2747 transitions. [2019-11-25 08:58:21,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:58:21,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 295 [2019-11-25 08:58:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:21,512 INFO L225 Difference]: With dead ends: 2631 [2019-11-25 08:58:21,512 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:58:21,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:58:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:58:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:58:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:58:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:58:21,515 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2019-11-25 08:58:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:21,515 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:58:21,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:58:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:58:21,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:58:21,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:58:21,966 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-25 08:58:22,280 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-25 08:58:22,282 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-25 08:58:22,282 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-25 08:58:22,283 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-25 08:58:22,284 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-25 08:58:22,284 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,284 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,284 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,284 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,284 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,284 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,284 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-25 08:58:22,284 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-25 08:58:22,284 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-25 08:58:22,284 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-25 08:58:22,285 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-25 08:58:22,286 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-25 08:58:22,287 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse11 (= ~a16~0 6))) (let ((.cse8 (<= ~a21~0 0)) (.cse14 (<= ~a7~0 0)) (.cse3 (= 1 ~a7~0)) (.cse7 (not .cse11)) (.cse2 (= ~a21~0 1)) (.cse5 (= ~a16~0 5)) (.cse1 (= ~a12~0 8)) (.cse9 (<= ~a17~0 0)) (.cse4 (= 15 ~a8~0)) (.cse6 (not .cse10)) (.cse12 (= ~a16~0 4)) (.cse13 (not .cse0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2) (and .cse3 .cse8 .cse1 .cse9 .cse10 .cse11) (and .cse3 .cse12 .cse9 .cse4) (and .cse10 .cse4 .cse13 .cse11) (and .cse9 .cse4 .cse5) (and (or (and .cse3 .cse9 .cse5) (and .cse3 .cse8 .cse12 .cse9)) .cse1) (and .cse3 .cse8 .cse7 .cse0 .cse1) (and .cse12 .cse1 .cse9 .cse2 .cse14 (= 14 ~a8~0)) (and (= 13 ~a8~0) .cse12 .cse1 .cse9 .cse2 .cse14) (and .cse3 .cse7 .cse0 .cse2) (and .cse6 .cse5) (and .cse6 .cse1 .cse4 .cse11) (and .cse12 .cse1 .cse9 .cse10 .cse4 .cse13) (and .cse6 .cse12 .cse13)))) [2019-11-25 08:58:22,287 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,287 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,287 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,287 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,287 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-25 08:58:22,288 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-25 08:58:22,289 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-25 08:58:22,289 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,289 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,289 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,289 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,289 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,289 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-25 08:58:22,289 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-25 08:58:22,289 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-25 08:58:22,289 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-25 08:58:22,289 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-25 08:58:22,289 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-25 08:58:22,290 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-25 08:58:22,291 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-25 08:58:22,291 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-25 08:58:22,291 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-25 08:58:22,291 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:58:22,291 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-25 08:58:22,291 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-25 08:58:22,291 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-25 08:58:22,291 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-25 08:58:22,293 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-25 08:58:22,293 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-25 08:58:22,293 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,293 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse11 (= ~a16~0 6))) (let ((.cse8 (<= ~a21~0 0)) (.cse14 (<= ~a7~0 0)) (.cse3 (= 1 ~a7~0)) (.cse7 (not .cse11)) (.cse2 (= ~a21~0 1)) (.cse5 (= ~a16~0 5)) (.cse1 (= ~a12~0 8)) (.cse9 (<= ~a17~0 0)) (.cse4 (= 15 ~a8~0)) (.cse6 (not .cse10)) (.cse12 (= ~a16~0 4)) (.cse13 (not .cse0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2) (and .cse3 .cse8 .cse1 .cse9 .cse10 .cse11) (and .cse3 .cse12 .cse9 .cse4) (and .cse10 .cse4 .cse13 .cse11) (and .cse9 .cse4 .cse5) (and (or (and .cse3 .cse9 .cse5) (and .cse3 .cse8 .cse12 .cse9)) .cse1) (and .cse3 .cse8 .cse7 .cse0 .cse1) (and .cse12 .cse1 .cse9 .cse2 .cse14 (= 14 ~a8~0)) (and (= 13 ~a8~0) .cse12 .cse1 .cse9 .cse2 .cse14) (and .cse3 .cse7 .cse0 .cse2) (and .cse6 .cse5) (and .cse6 .cse1 .cse4 .cse11) (and .cse12 .cse1 .cse9 .cse10 .cse4 .cse13) (and .cse6 .cse12 .cse13)))) [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-25 08:58:22,294 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-25 08:58:22,295 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-25 08:58:22,296 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-25 08:58:22,296 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-25 08:58:22,296 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,296 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,296 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,296 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,296 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-25 08:58:22,296 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,296 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,296 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-25 08:58:22,297 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-25 08:58:22,297 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:58:22,297 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-25 08:58:22,297 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-25 08:58:22,297 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-25 08:58:22,297 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-25 08:58:22,297 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-25 08:58:22,297 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-25 08:58:22,298 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-25 08:58:22,298 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-25 08:58:22,298 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-25 08:58:22,298 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-25 08:58:22,298 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,298 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,298 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,298 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,298 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,298 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-25 08:58:22,298 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:58:22,299 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 569) no Hoare annotation was computed. [2019-11-25 08:58:22,300 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-25 08:58:22,300 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-25 08:58:22,300 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-25 08:58:22,300 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,300 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,300 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,300 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,300 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,301 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:58:22,301 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-25 08:58:22,301 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-25 08:58:22,301 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-25 08:58:22,301 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-25 08:58:22,301 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-25 08:58:22,301 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-25 08:58:22,301 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-25 08:58:22,302 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-25 08:58:22,302 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-25 08:58:22,302 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-25 08:58:22,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:58:22 BoogieIcfgContainer [2019-11-25 08:58:22,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:58:22,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:58:22,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:58:22,329 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:58:22,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:58:06" (3/4) ... [2019-11-25 08:58:22,333 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:58:22,353 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:58:22,355 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:58:22,524 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dff6968d-df43-407a-aeca-5d8db47cac11/bin/uautomizer/witness.graphml [2019-11-25 08:58:22,524 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:58:22,526 INFO L168 Benchmark]: Toolchain (without parser) took 17975.00 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 576.7 MB). Free memory was 939.3 MB in the beginning and 1.4 GB in the end (delta: -510.3 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,526 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:58:22,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 573.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,527 INFO L168 Benchmark]: Boogie Preprocessor took 64.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,527 INFO L168 Benchmark]: RCFGBuilder took 1322.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 117.8 MB). Peak memory consumption was 117.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,528 INFO L168 Benchmark]: TraceAbstraction took 15736.57 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 417.3 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -464.9 MB). Peak memory consumption was 586.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,528 INFO L168 Benchmark]: Witness Printer took 195.54 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:22,530 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 573.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1322.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 117.8 MB). Peak memory consumption was 117.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15736.57 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 417.3 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -464.9 MB). Peak memory consumption was 586.6 MB. Max. memory is 11.5 GB. * Witness Printer took 195.54 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 1 && a12 == 8) && a21 == 1) || ((1 == a7 && 15 == a8) && a16 == 5)) || (((!(a20 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((((1 == a7 && a21 <= 0) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || ((((1 == a7 && a17 <= 0) && a16 == 5) || (((1 == a7 && a21 <= 0) && a16 == 4) && a17 <= 0)) && a12 == 8)) || ((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0) && 14 == a8)) || (((((13 == a8 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || (((!(a20 == 1) && a12 == 8) && 15 == a8) && a16 == 6)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a20 == 1) && 15 == a8) && !(a17 == 1))) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 1 && a12 == 8) && a21 == 1) || ((1 == a7 && 15 == a8) && a16 == 5)) || (((!(a20 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((((1 == a7 && a21 <= 0) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || ((((1 == a7 && a17 <= 0) && a16 == 5) || (((1 == a7 && a21 <= 0) && a16 == 4) && a17 <= 0)) && a12 == 8)) || ((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0) && 14 == a8)) || (((((13 == a8 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || (((!(a20 == 1) && a12 == 8) && 15 == a8) && a16 == 6)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a20 == 1) && 15 == a8) && !(a17 == 1))) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 15.6s, OverallIterations: 14, TraceHistogramMax: 6, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 1110 SDtfs, 2796 SDslu, 156 SDs, 0 SdLazy, 7086 SolverSat, 816 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 307 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2682occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1576 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 50 NumberOfFragments, 487 HoareAnnotationTreeSize, 3 FomulaSimplifications, 866 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 306 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3021 NumberOfCodeBlocks, 3021 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3006 ConstructedInterpolants, 0 QuantifiedInterpolants, 3254078 SizeOfPredicates, 1 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1895/1899 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...