./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label48.c -s /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/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 9f9c3a25932676bec80072ad05bb4d96280afa80 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:27:59,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:27:59,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:27:59,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:27:59,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:27:59,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:27:59,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:27:59,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:27:59,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:27:59,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:27:59,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:27:59,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:27:59,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:27:59,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:27:59,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:27:59,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:27:59,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:27:59,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:27:59,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:27:59,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:27:59,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:27:59,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:27:59,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:27:59,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:27:59,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:27:59,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:27:59,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:27:59,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:27:59,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:27:59,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:27:59,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:27:59,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:27:59,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:27:59,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:27:59,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:27:59,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:27:59,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:27:59,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:27:59,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:27:59,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:27:59,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:27:59,569 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:27:59,581 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:27:59,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:27:59,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:27:59,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:27:59,583 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:27:59,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:27:59,583 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:27:59,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:27:59,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:27:59,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:27:59,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:27:59,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:27:59,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:27:59,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:27:59,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:27:59,585 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:27:59,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:27:59,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:27:59,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:27:59,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:27:59,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:27:59,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:27:59,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:27:59,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:27:59,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:27:59,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:27:59,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:27:59,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:27:59,588 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:27:59,588 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_09607d06-1675-4278-97b1-bf32692bca6d/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 -> 9f9c3a25932676bec80072ad05bb4d96280afa80 [2019-12-07 17:27:59,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:27:59,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:27:59,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:27:59,698 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:27:59,698 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:27:59,699 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2019-12-07 17:27:59,735 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/data/8def0944a/11aca59598414244ac8c60858e120f44/FLAG16e4bbde3 [2019-12-07 17:28:00,129 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:28:00,130 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2019-12-07 17:28:00,139 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/data/8def0944a/11aca59598414244ac8c60858e120f44/FLAG16e4bbde3 [2019-12-07 17:28:00,148 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/data/8def0944a/11aca59598414244ac8c60858e120f44 [2019-12-07 17:28:00,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:28:00,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:28:00,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:28:00,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:28:00,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:28:00,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:28:00" (1/1) ... [2019-12-07 17:28:00,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ba895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00, skipping insertion in model container [2019-12-07 17:28:00,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:28:00" (1/1) ... [2019-12-07 17:28:00,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:28:00,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:28:00,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:28:00,476 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:28:00,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:28:00,559 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:28:00,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00 WrapperNode [2019-12-07 17:28:00,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:28:00,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:28:00,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:28:00,560 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:28:00,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00" (1/1) ... [2019-12-07 17:28:00,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00" (1/1) ... [2019-12-07 17:28:00,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:28:00,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:28:00,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:28:00,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:28:00,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00" (1/1) ... [2019-12-07 17:28:00,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00" (1/1) ... [2019-12-07 17:28:00,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00" (1/1) ... [2019-12-07 17:28:00,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00" (1/1) ... [2019-12-07 17:28:00,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00" (1/1) ... [2019-12-07 17:28:00,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00" (1/1) ... [2019-12-07 17:28:00,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00" (1/1) ... [2019-12-07 17:28:00,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:28:00,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:28:00,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:28:00,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:28:00,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/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-12-07 17:28:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:28:00,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:28:01,481 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:28:01,481 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:28:01,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:28:01 BoogieIcfgContainer [2019-12-07 17:28:01,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:28:01,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:28:01,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:28:01,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:28:01,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:28:00" (1/3) ... [2019-12-07 17:28:01,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252d6457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:28:01, skipping insertion in model container [2019-12-07 17:28:01,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:00" (2/3) ... [2019-12-07 17:28:01,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252d6457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:28:01, skipping insertion in model container [2019-12-07 17:28:01,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:28:01" (3/3) ... [2019-12-07 17:28:01,488 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label48.c [2019-12-07 17:28:01,495 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:28:01,501 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:28:01,509 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:28:01,528 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:28:01,528 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:28:01,528 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:28:01,528 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:28:01,528 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:28:01,529 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:28:01,529 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:28:01,529 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:28:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-12-07 17:28:01,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 17:28:01,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:01,551 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] [2019-12-07 17:28:01,551 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:01,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:01,555 INFO L82 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2019-12-07 17:28:01,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:01,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685248480] [2019-12-07 17:28:01,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:01,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685248480] [2019-12-07 17:28:01,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:01,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:28:01,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151826939] [2019-12-07 17:28:01,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:01,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:01,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:01,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:01,740 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-12-07 17:28:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:02,779 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-12-07 17:28:02,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:02,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-07 17:28:02,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:02,793 INFO L225 Difference]: With dead ends: 850 [2019-12-07 17:28:02,793 INFO L226 Difference]: Without dead ends: 538 [2019-12-07 17:28:02,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-12-07 17:28:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-12-07 17:28:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-07 17:28:02,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 814 transitions. [2019-12-07 17:28:02,844 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 814 transitions. Word has length 38 [2019-12-07 17:28:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:02,845 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 814 transitions. [2019-12-07 17:28:02,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 814 transitions. [2019-12-07 17:28:02,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 17:28:02,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:02,849 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:28:02,849 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:02,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:02,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1126953967, now seen corresponding path program 1 times [2019-12-07 17:28:02,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:02,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060142544] [2019-12-07 17:28:02,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:02,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060142544] [2019-12-07 17:28:02,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:02,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:28:02,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623359118] [2019-12-07 17:28:02,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:02,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:02,963 INFO L87 Difference]: Start difference. First operand 538 states and 814 transitions. Second operand 4 states. [2019-12-07 17:28:03,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:03,728 INFO L93 Difference]: Finished difference Result 2142 states and 3248 transitions. [2019-12-07 17:28:03,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:03,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-12-07 17:28:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:03,736 INFO L225 Difference]: With dead ends: 2142 [2019-12-07 17:28:03,736 INFO L226 Difference]: Without dead ends: 1606 [2019-12-07 17:28:03,738 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-12-07 17:28:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-12-07 17:28:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-12-07 17:28:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 17:28:03,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1993 transitions. [2019-12-07 17:28:03,767 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1993 transitions. Word has length 120 [2019-12-07 17:28:03,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:03,768 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1993 transitions. [2019-12-07 17:28:03,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:03,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1993 transitions. [2019-12-07 17:28:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-12-07 17:28:03,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:03,771 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:28:03,771 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:03,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1627228242, now seen corresponding path program 1 times [2019-12-07 17:28:03,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:03,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660980968] [2019-12-07 17:28:03,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 17:28:03,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660980968] [2019-12-07 17:28:03,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:03,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:28:03,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833405324] [2019-12-07 17:28:03,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:03,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:03,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:03,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:03,859 INFO L87 Difference]: Start difference. First operand 1428 states and 1993 transitions. Second operand 4 states. [2019-12-07 17:28:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:04,746 INFO L93 Difference]: Finished difference Result 4990 states and 7108 transitions. [2019-12-07 17:28:04,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:04,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-12-07 17:28:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:04,759 INFO L225 Difference]: With dead ends: 4990 [2019-12-07 17:28:04,760 INFO L226 Difference]: Without dead ends: 3564 [2019-12-07 17:28:04,761 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-12-07 17:28:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-12-07 17:28:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2852. [2019-12-07 17:28:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-07 17:28:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3785 transitions. [2019-12-07 17:28:04,805 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3785 transitions. Word has length 183 [2019-12-07 17:28:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:04,806 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3785 transitions. [2019-12-07 17:28:04,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3785 transitions. [2019-12-07 17:28:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-12-07 17:28:04,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:04,808 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:28:04,808 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash -233481583, now seen corresponding path program 1 times [2019-12-07 17:28:04,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:04,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360852015] [2019-12-07 17:28:04,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 138 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 17:28:04,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360852015] [2019-12-07 17:28:04,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714986245] [2019-12-07 17:28:04,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/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-12-07 17:28:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:05,036 INFO L264 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:28:05,043 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-07 17:28:05,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:28:05,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 17:28:05,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966876379] [2019-12-07 17:28:05,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:28:05,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:05,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:28:05,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:28:05,088 INFO L87 Difference]: Start difference. First operand 2852 states and 3785 transitions. Second operand 3 states. [2019-12-07 17:28:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:05,615 INFO L93 Difference]: Finished difference Result 6592 states and 8699 transitions. [2019-12-07 17:28:05,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:28:05,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-12-07 17:28:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:05,632 INFO L225 Difference]: With dead ends: 6592 [2019-12-07 17:28:05,632 INFO L226 Difference]: Without dead ends: 3564 [2019-12-07 17:28:05,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:28:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-12-07 17:28:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2674. [2019-12-07 17:28:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-12-07 17:28:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3524 transitions. [2019-12-07 17:28:05,685 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3524 transitions. Word has length 197 [2019-12-07 17:28:05,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:05,686 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3524 transitions. [2019-12-07 17:28:05,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:28:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3524 transitions. [2019-12-07 17:28:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-12-07 17:28:05,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:05,690 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:28:05,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:05,891 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:05,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1453272931, now seen corresponding path program 1 times [2019-12-07 17:28:05,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:05,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427549630] [2019-12-07 17:28:05,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 247 proven. 4 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 17:28:06,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427549630] [2019-12-07 17:28:06,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019529787] [2019-12-07 17:28:06,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:06,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:28:06,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 17:28:06,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:28:06,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 17:28:06,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741922840] [2019-12-07 17:28:06,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:06,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:06,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:06,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:28:06,307 INFO L87 Difference]: Start difference. First operand 2674 states and 3524 transitions. Second operand 4 states. [2019-12-07 17:28:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:06,811 INFO L93 Difference]: Finished difference Result 5553 states and 7259 transitions. [2019-12-07 17:28:06,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:06,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-12-07 17:28:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:06,821 INFO L225 Difference]: With dead ends: 5553 [2019-12-07 17:28:06,821 INFO L226 Difference]: Without dead ends: 2852 [2019-12-07 17:28:06,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:28:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-12-07 17:28:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2019-12-07 17:28:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-12-07 17:28:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3011 transitions. [2019-12-07 17:28:06,857 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3011 transitions. Word has length 308 [2019-12-07 17:28:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:06,857 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3011 transitions. [2019-12-07 17:28:06,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3011 transitions. [2019-12-07 17:28:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-12-07 17:28:06,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:06,863 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:07,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:07,064 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:07,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1536337896, now seen corresponding path program 1 times [2019-12-07 17:28:07,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:07,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837183696] [2019-12-07 17:28:07,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 398 proven. 65 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:28:07,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837183696] [2019-12-07 17:28:07,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791927589] [2019-12-07 17:28:07,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:07,560 INFO L264 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:28:07,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 17:28:07,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:28:07,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-12-07 17:28:07,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262620577] [2019-12-07 17:28:07,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:28:07,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:07,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:28:07,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:28:07,798 INFO L87 Difference]: Start difference. First operand 2674 states and 3011 transitions. Second operand 7 states. [2019-12-07 17:28:08,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:08,387 INFO L93 Difference]: Finished difference Result 5574 states and 6254 transitions. [2019-12-07 17:28:08,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:28:08,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 403 [2019-12-07 17:28:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:08,397 INFO L225 Difference]: With dead ends: 5574 [2019-12-07 17:28:08,397 INFO L226 Difference]: Without dead ends: 2852 [2019-12-07 17:28:08,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:28:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-12-07 17:28:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2019-12-07 17:28:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-12-07 17:28:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2954 transitions. [2019-12-07 17:28:08,428 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2954 transitions. Word has length 403 [2019-12-07 17:28:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:08,429 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2954 transitions. [2019-12-07 17:28:08,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:28:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2954 transitions. [2019-12-07 17:28:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-12-07 17:28:08,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:08,437 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:28:08,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:08,637 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash 929105321, now seen corresponding path program 1 times [2019-12-07 17:28:08,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:08,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308118723] [2019-12-07 17:28:08,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 569 proven. 4 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:28:09,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308118723] [2019-12-07 17:28:09,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709959195] [2019-12-07 17:28:09,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:09,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:28:09,310 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:09,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 550 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:28:09,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:28:09,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-12-07 17:28:09,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447429039] [2019-12-07 17:28:09,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:28:09,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:09,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:28:09,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:28:09,676 INFO L87 Difference]: Start difference. First operand 2674 states and 2954 transitions. Second operand 8 states. [2019-12-07 17:28:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:10,761 INFO L93 Difference]: Finished difference Result 6109 states and 6687 transitions. [2019-12-07 17:28:10,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:28:10,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 530 [2019-12-07 17:28:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:10,777 INFO L225 Difference]: With dead ends: 6109 [2019-12-07 17:28:10,777 INFO L226 Difference]: Without dead ends: 3437 [2019-12-07 17:28:10,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:28:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2019-12-07 17:28:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 2674. [2019-12-07 17:28:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-12-07 17:28:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2952 transitions. [2019-12-07 17:28:10,818 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2952 transitions. Word has length 530 [2019-12-07 17:28:10,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:10,819 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2952 transitions. [2019-12-07 17:28:10,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:28:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2952 transitions. [2019-12-07 17:28:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2019-12-07 17:28:10,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:10,823 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:11,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:11,024 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash -69619708, now seen corresponding path program 1 times [2019-12-07 17:28:11,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:11,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447428598] [2019-12-07 17:28:11,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 664 proven. 174 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2019-12-07 17:28:12,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447428598] [2019-12-07 17:28:12,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252077357] [2019-12-07 17:28:12,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:12,164 INFO L264 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:28:12,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 809 proven. 29 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2019-12-07 17:28:12,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:28:12,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-12-07 17:28:12,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902801598] [2019-12-07 17:28:12,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:28:12,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:12,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:28:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:28:12,867 INFO L87 Difference]: Start difference. First operand 2674 states and 2952 transitions. Second operand 8 states. [2019-12-07 17:28:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:13,636 INFO L93 Difference]: Finished difference Result 6111 states and 6693 transitions. [2019-12-07 17:28:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:28:13,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 664 [2019-12-07 17:28:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:13,647 INFO L225 Difference]: With dead ends: 6111 [2019-12-07 17:28:13,647 INFO L226 Difference]: Without dead ends: 3439 [2019-12-07 17:28:13,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 661 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:28:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3439 states. [2019-12-07 17:28:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 2852. [2019-12-07 17:28:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-07 17:28:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3134 transitions. [2019-12-07 17:28:13,679 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3134 transitions. Word has length 664 [2019-12-07 17:28:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:13,680 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3134 transitions. [2019-12-07 17:28:13,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:28:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3134 transitions. [2019-12-07 17:28:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-12-07 17:28:13,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:13,684 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:13,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:13,885 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:13,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash -711897079, now seen corresponding path program 1 times [2019-12-07 17:28:13,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:13,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959935264] [2019-12-07 17:28:13,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 849 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2019-12-07 17:28:14,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959935264] [2019-12-07 17:28:14,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:14,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:28:14,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520108955] [2019-12-07 17:28:14,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:28:14,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:14,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:28:14,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:14,877 INFO L87 Difference]: Start difference. First operand 2852 states and 3134 transitions. Second operand 7 states. [2019-12-07 17:28:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:15,940 INFO L93 Difference]: Finished difference Result 6295 states and 6875 transitions. [2019-12-07 17:28:15,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:28:15,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 675 [2019-12-07 17:28:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:15,953 INFO L225 Difference]: With dead ends: 6295 [2019-12-07 17:28:15,953 INFO L226 Difference]: Without dead ends: 3445 [2019-12-07 17:28:15,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:28:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2019-12-07 17:28:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3030. [2019-12-07 17:28:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-12-07 17:28:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3315 transitions. [2019-12-07 17:28:15,984 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3315 transitions. Word has length 675 [2019-12-07 17:28:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:15,985 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3315 transitions. [2019-12-07 17:28:15,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:28:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3315 transitions. [2019-12-07 17:28:15,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-12-07 17:28:15,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:15,989 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:15,990 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:15,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:15,990 INFO L82 PathProgramCache]: Analyzing trace with hash 105793533, now seen corresponding path program 1 times [2019-12-07 17:28:15,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:15,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941038916] [2019-12-07 17:28:15,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 1070 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2019-12-07 17:28:16,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941038916] [2019-12-07 17:28:16,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:16,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:28:16,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862363410] [2019-12-07 17:28:16,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:28:16,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:28:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:28:16,292 INFO L87 Difference]: Start difference. First operand 3030 states and 3315 transitions. Second operand 3 states. [2019-12-07 17:28:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:16,625 INFO L93 Difference]: Finished difference Result 7304 states and 7950 transitions. [2019-12-07 17:28:16,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:28:16,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 691 [2019-12-07 17:28:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:16,641 INFO L225 Difference]: With dead ends: 7304 [2019-12-07 17:28:16,641 INFO L226 Difference]: Without dead ends: 4276 [2019-12-07 17:28:16,643 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-12-07 17:28:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-12-07 17:28:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3920. [2019-12-07 17:28:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-12-07 17:28:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4235 transitions. [2019-12-07 17:28:16,682 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4235 transitions. Word has length 691 [2019-12-07 17:28:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:16,683 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4235 transitions. [2019-12-07 17:28:16,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:28:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4235 transitions. [2019-12-07 17:28:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2019-12-07 17:28:16,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:16,688 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:16,688 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1452861494, now seen corresponding path program 1 times [2019-12-07 17:28:16,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:16,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022189835] [2019-12-07 17:28:16,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 1415 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2019-12-07 17:28:17,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022189835] [2019-12-07 17:28:17,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:17,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:28:17,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220833192] [2019-12-07 17:28:17,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:17,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:17,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:17,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:17,209 INFO L87 Difference]: Start difference. First operand 3920 states and 4235 transitions. Second operand 4 states. [2019-12-07 17:28:17,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:17,801 INFO L93 Difference]: Finished difference Result 9084 states and 9866 transitions. [2019-12-07 17:28:17,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:17,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 846 [2019-12-07 17:28:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:17,809 INFO L225 Difference]: With dead ends: 9084 [2019-12-07 17:28:17,810 INFO L226 Difference]: Without dead ends: 4988 [2019-12-07 17:28:17,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-12-07 17:28:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2019-12-07 17:28:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-12-07 17:28:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4946 transitions. [2019-12-07 17:28:17,851 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4946 transitions. Word has length 846 [2019-12-07 17:28:17,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:17,851 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4946 transitions. [2019-12-07 17:28:17,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4946 transitions. [2019-12-07 17:28:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2019-12-07 17:28:17,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:17,857 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:17,857 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:17,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1223574979, now seen corresponding path program 1 times [2019-12-07 17:28:17,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:17,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505323014] [2019-12-07 17:28:17,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 1576 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-12-07 17:28:19,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505323014] [2019-12-07 17:28:19,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:19,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:28:19,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381708536] [2019-12-07 17:28:19,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:28:19,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:19,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:28:19,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:19,121 INFO L87 Difference]: Start difference. First operand 4632 states and 4946 transitions. Second operand 7 states. [2019-12-07 17:28:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:19,753 INFO L93 Difference]: Finished difference Result 9265 states and 9896 transitions. [2019-12-07 17:28:19,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:28:19,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 864 [2019-12-07 17:28:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:19,759 INFO L225 Difference]: With dead ends: 9265 [2019-12-07 17:28:19,759 INFO L226 Difference]: Without dead ends: 4813 [2019-12-07 17:28:19,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:28:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2019-12-07 17:28:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 4632. [2019-12-07 17:28:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-12-07 17:28:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4941 transitions. [2019-12-07 17:28:19,811 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4941 transitions. Word has length 864 [2019-12-07 17:28:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:19,812 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4941 transitions. [2019-12-07 17:28:19,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:28:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4941 transitions. [2019-12-07 17:28:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2019-12-07 17:28:19,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:19,822 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:19,822 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:19,822 INFO L82 PathProgramCache]: Analyzing trace with hash 377118381, now seen corresponding path program 1 times [2019-12-07 17:28:19,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:19,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143544368] [2019-12-07 17:28:19,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1705 proven. 144 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-12-07 17:28:20,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143544368] [2019-12-07 17:28:20,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083661093] [2019-12-07 17:28:20,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:20,688 INFO L264 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:28:20,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:20,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:20,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1490 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2019-12-07 17:28:22,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:28:22,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-12-07 17:28:22,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418995669] [2019-12-07 17:28:22,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:22,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:22,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:22,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:28:22,059 INFO L87 Difference]: Start difference. First operand 4632 states and 4941 transitions. Second operand 4 states. [2019-12-07 17:28:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:23,135 INFO L93 Difference]: Finished difference Result 9974 states and 10637 transitions. [2019-12-07 17:28:23,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:23,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 941 [2019-12-07 17:28:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:23,143 INFO L225 Difference]: With dead ends: 9974 [2019-12-07 17:28:23,143 INFO L226 Difference]: Without dead ends: 5522 [2019-12-07 17:28:23,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 940 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:28:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2019-12-07 17:28:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5166. [2019-12-07 17:28:23,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-12-07 17:28:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5492 transitions. [2019-12-07 17:28:23,190 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5492 transitions. Word has length 941 [2019-12-07 17:28:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:23,191 INFO L462 AbstractCegarLoop]: Abstraction has 5166 states and 5492 transitions. [2019-12-07 17:28:23,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5492 transitions. [2019-12-07 17:28:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1164 [2019-12-07 17:28:23,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:23,199 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:23,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:23,400 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:23,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1057461046, now seen corresponding path program 1 times [2019-12-07 17:28:23,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:23,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379446770] [2019-12-07 17:28:23,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4520 backedges. 1081 proven. 0 refuted. 0 times theorem prover too weak. 3439 trivial. 0 not checked. [2019-12-07 17:28:24,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379446770] [2019-12-07 17:28:24,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:24,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:28:24,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857007518] [2019-12-07 17:28:24,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:24,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:24,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:24,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:24,206 INFO L87 Difference]: Start difference. First operand 5166 states and 5492 transitions. Second operand 4 states. [2019-12-07 17:28:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:24,800 INFO L93 Difference]: Finished difference Result 10330 states and 10987 transitions. [2019-12-07 17:28:24,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:24,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1163 [2019-12-07 17:28:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:24,808 INFO L225 Difference]: With dead ends: 10330 [2019-12-07 17:28:24,808 INFO L226 Difference]: Without dead ends: 5166 [2019-12-07 17:28:24,813 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-12-07 17:28:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-12-07 17:28:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4988. [2019-12-07 17:28:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-12-07 17:28:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5210 transitions. [2019-12-07 17:28:24,857 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5210 transitions. Word has length 1163 [2019-12-07 17:28:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:24,858 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5210 transitions. [2019-12-07 17:28:24,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5210 transitions. [2019-12-07 17:28:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1182 [2019-12-07 17:28:24,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:24,867 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:24,867 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:24,868 INFO L82 PathProgramCache]: Analyzing trace with hash -192069251, now seen corresponding path program 1 times [2019-12-07 17:28:24,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:24,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492149146] [2019-12-07 17:28:24,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4567 backedges. 1883 proven. 0 refuted. 0 times theorem prover too weak. 2684 trivial. 0 not checked. [2019-12-07 17:28:25,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492149146] [2019-12-07 17:28:25,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:25,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:28:25,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488928952] [2019-12-07 17:28:25,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:25,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:25,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:25,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:25,857 INFO L87 Difference]: Start difference. First operand 4988 states and 5210 transitions. Second operand 4 states. [2019-12-07 17:28:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:26,351 INFO L93 Difference]: Finished difference Result 9974 states and 10422 transitions. [2019-12-07 17:28:26,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:26,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1181 [2019-12-07 17:28:26,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:26,354 INFO L225 Difference]: With dead ends: 9974 [2019-12-07 17:28:26,354 INFO L226 Difference]: Without dead ends: 4988 [2019-12-07 17:28:26,357 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-12-07 17:28:26,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-12-07 17:28:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4988. [2019-12-07 17:28:26,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-12-07 17:28:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5180 transitions. [2019-12-07 17:28:26,393 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5180 transitions. Word has length 1181 [2019-12-07 17:28:26,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:26,393 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5180 transitions. [2019-12-07 17:28:26,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5180 transitions. [2019-12-07 17:28:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2019-12-07 17:28:26,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:26,402 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:26,402 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:26,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:26,402 INFO L82 PathProgramCache]: Analyzing trace with hash -244585356, now seen corresponding path program 1 times [2019-12-07 17:28:26,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:26,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884129032] [2019-12-07 17:28:26,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4793 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 4434 trivial. 0 not checked. [2019-12-07 17:28:27,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884129032] [2019-12-07 17:28:27,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:27,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:28:27,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512282568] [2019-12-07 17:28:27,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:28:27,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:27,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:28:27,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:28:27,254 INFO L87 Difference]: Start difference. First operand 4988 states and 5180 transitions. Second operand 3 states. [2019-12-07 17:28:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:27,580 INFO L93 Difference]: Finished difference Result 10152 states and 10546 transitions. [2019-12-07 17:28:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:28:27,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1223 [2019-12-07 17:28:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:27,584 INFO L225 Difference]: With dead ends: 10152 [2019-12-07 17:28:27,584 INFO L226 Difference]: Without dead ends: 5344 [2019-12-07 17:28:27,587 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-12-07 17:28:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2019-12-07 17:28:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4988. [2019-12-07 17:28:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-12-07 17:28:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5180 transitions. [2019-12-07 17:28:27,624 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5180 transitions. Word has length 1223 [2019-12-07 17:28:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:27,625 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5180 transitions. [2019-12-07 17:28:27,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:28:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5180 transitions. [2019-12-07 17:28:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1288 [2019-12-07 17:28:27,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:27,634 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:28:27,634 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:27,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:27,634 INFO L82 PathProgramCache]: Analyzing trace with hash 321945556, now seen corresponding path program 1 times [2019-12-07 17:28:27,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:27,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459938432] [2019-12-07 17:28:27,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 2515 proven. 12 refuted. 0 times theorem prover too weak. 2408 trivial. 0 not checked. [2019-12-07 17:28:28,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459938432] [2019-12-07 17:28:28,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161713578] [2019-12-07 17:28:28,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:29,016 INFO L264 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:28:29,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 2515 proven. 0 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2019-12-07 17:28:29,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:28:29,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 17:28:29,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376953448] [2019-12-07 17:28:29,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:28:29,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:29,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:28:29,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:29,877 INFO L87 Difference]: Start difference. First operand 4988 states and 5180 transitions. Second operand 3 states. [2019-12-07 17:28:30,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:30,184 INFO L93 Difference]: Finished difference Result 9796 states and 10179 transitions. [2019-12-07 17:28:30,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:28:30,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1287 [2019-12-07 17:28:30,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:30,187 INFO L225 Difference]: With dead ends: 9796 [2019-12-07 17:28:30,187 INFO L226 Difference]: Without dead ends: 4988 [2019-12-07 17:28:30,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1291 GetRequests, 1287 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-12-07 17:28:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4810. [2019-12-07 17:28:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-12-07 17:28:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4950 transitions. [2019-12-07 17:28:30,221 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4950 transitions. Word has length 1287 [2019-12-07 17:28:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:30,221 INFO L462 AbstractCegarLoop]: Abstraction has 4810 states and 4950 transitions. [2019-12-07 17:28:30,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:28:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4950 transitions. [2019-12-07 17:28:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1652 [2019-12-07 17:28:30,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:30,236 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:30,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:30,437 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash 292188241, now seen corresponding path program 1 times [2019-12-07 17:28:30,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:30,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611573799] [2019-12-07 17:28:30,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8364 backedges. 2751 proven. 0 refuted. 0 times theorem prover too weak. 5613 trivial. 0 not checked. [2019-12-07 17:28:32,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611573799] [2019-12-07 17:28:32,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:32,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:28:32,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839724757] [2019-12-07 17:28:32,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:32,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:32,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:32,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:32,012 INFO L87 Difference]: Start difference. First operand 4810 states and 4950 transitions. Second operand 4 states. [2019-12-07 17:28:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:32,539 INFO L93 Difference]: Finished difference Result 9618 states and 9901 transitions. [2019-12-07 17:28:32,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:32,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1651 [2019-12-07 17:28:32,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:32,542 INFO L225 Difference]: With dead ends: 9618 [2019-12-07 17:28:32,542 INFO L226 Difference]: Without dead ends: 3742 [2019-12-07 17:28:32,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-12-07 17:28:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2019-12-07 17:28:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-12-07 17:28:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3816 transitions. [2019-12-07 17:28:32,568 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3816 transitions. Word has length 1651 [2019-12-07 17:28:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:32,569 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3816 transitions. [2019-12-07 17:28:32,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3816 transitions. [2019-12-07 17:28:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1670 [2019-12-07 17:28:32,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:32,583 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:32,584 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:32,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:32,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1222533483, now seen corresponding path program 1 times [2019-12-07 17:28:32,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:32,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749810488] [2019-12-07 17:28:32,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8470 backedges. 2593 proven. 0 refuted. 0 times theorem prover too weak. 5877 trivial. 0 not checked. [2019-12-07 17:28:35,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749810488] [2019-12-07 17:28:35,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:35,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:28:35,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127764365] [2019-12-07 17:28:35,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:28:35,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:35,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:28:35,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:35,157 INFO L87 Difference]: Start difference. First operand 3742 states and 3816 transitions. Second operand 7 states. [2019-12-07 17:28:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:35,642 INFO L93 Difference]: Finished difference Result 7556 states and 7706 transitions. [2019-12-07 17:28:35,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:28:35,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1669 [2019-12-07 17:28:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:35,645 INFO L225 Difference]: With dead ends: 7556 [2019-12-07 17:28:35,645 INFO L226 Difference]: Without dead ends: 3920 [2019-12-07 17:28:35,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-12-07 17:28:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2019-12-07 17:28:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-12-07 17:28:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3811 transitions. [2019-12-07 17:28:35,671 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3811 transitions. Word has length 1669 [2019-12-07 17:28:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:35,672 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3811 transitions. [2019-12-07 17:28:35,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:28:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3811 transitions. [2019-12-07 17:28:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1723 [2019-12-07 17:28:35,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:35,687 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:28:35,687 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:35,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1151917844, now seen corresponding path program 1 times [2019-12-07 17:28:35,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:35,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465306689] [2019-12-07 17:28:35,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9629 backedges. 1553 proven. 0 refuted. 0 times theorem prover too weak. 8076 trivial. 0 not checked. [2019-12-07 17:28:37,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465306689] [2019-12-07 17:28:37,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:37,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:28:37,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917297751] [2019-12-07 17:28:37,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:28:37,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:37,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:28:37,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:37,355 INFO L87 Difference]: Start difference. First operand 3742 states and 3811 transitions. Second operand 5 states. [2019-12-07 17:28:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:37,967 INFO L93 Difference]: Finished difference Result 5168 states and 5276 transitions. [2019-12-07 17:28:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:28:37,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1722 [2019-12-07 17:28:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:37,971 INFO L225 Difference]: With dead ends: 5168 [2019-12-07 17:28:37,971 INFO L226 Difference]: Without dead ends: 4988 [2019-12-07 17:28:37,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-07 17:28:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-12-07 17:28:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4454. [2019-12-07 17:28:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-12-07 17:28:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4545 transitions. [2019-12-07 17:28:38,000 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4545 transitions. Word has length 1722 [2019-12-07 17:28:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:38,001 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4545 transitions. [2019-12-07 17:28:38,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:28:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4545 transitions. [2019-12-07 17:28:38,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1728 [2019-12-07 17:28:38,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:38,016 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:28:38,016 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:38,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:38,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1097919814, now seen corresponding path program 1 times [2019-12-07 17:28:38,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:38,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142136496] [2019-12-07 17:28:38,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9684 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 9181 trivial. 0 not checked. [2019-12-07 17:28:39,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142136496] [2019-12-07 17:28:39,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:39,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:28:39,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433216151] [2019-12-07 17:28:39,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:28:39,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:39,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:28:39,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:28:39,591 INFO L87 Difference]: Start difference. First operand 4454 states and 4545 transitions. Second operand 3 states. [2019-12-07 17:28:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:39,889 INFO L93 Difference]: Finished difference Result 8906 states and 9088 transitions. [2019-12-07 17:28:39,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:28:39,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1727 [2019-12-07 17:28:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:39,893 INFO L225 Difference]: With dead ends: 8906 [2019-12-07 17:28:39,893 INFO L226 Difference]: Without dead ends: 4454 [2019-12-07 17:28:39,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:28:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-12-07 17:28:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4098. [2019-12-07 17:28:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-12-07 17:28:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4152 transitions. [2019-12-07 17:28:39,919 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4152 transitions. Word has length 1727 [2019-12-07 17:28:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:39,920 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4152 transitions. [2019-12-07 17:28:39,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:28:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4152 transitions. [2019-12-07 17:28:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1728 [2019-12-07 17:28:39,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:39,935 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:28:39,936 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1415086703, now seen corresponding path program 1 times [2019-12-07 17:28:39,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:39,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614737605] [2019-12-07 17:28:39,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9651 backedges. 6081 proven. 426 refuted. 0 times theorem prover too weak. 3144 trivial. 0 not checked. [2019-12-07 17:28:43,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614737605] [2019-12-07 17:28:43,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776906393] [2019-12-07 17:28:43,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:44,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 2086 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:28:44,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9651 backedges. 6507 proven. 0 refuted. 0 times theorem prover too weak. 3144 trivial. 0 not checked. [2019-12-07 17:28:47,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:28:47,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-12-07 17:28:47,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626224030] [2019-12-07 17:28:47,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:28:47,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:47,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:28:47,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:28:47,546 INFO L87 Difference]: Start difference. First operand 4098 states and 4152 transitions. Second operand 6 states. [2019-12-07 17:28:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:48,293 INFO L93 Difference]: Finished difference Result 7304 states and 7410 transitions. [2019-12-07 17:28:48,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:28:48,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1727 [2019-12-07 17:28:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:48,296 INFO L225 Difference]: With dead ends: 7304 [2019-12-07 17:28:48,296 INFO L226 Difference]: Without dead ends: 4276 [2019-12-07 17:28:48,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1733 GetRequests, 1724 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:28:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-12-07 17:28:48,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2019-12-07 17:28:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-12-07 17:28:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4334 transitions. [2019-12-07 17:28:48,322 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4334 transitions. Word has length 1727 [2019-12-07 17:28:48,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:48,323 INFO L462 AbstractCegarLoop]: Abstraction has 4276 states and 4334 transitions. [2019-12-07 17:28:48,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:28:48,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4334 transitions. [2019-12-07 17:28:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1893 [2019-12-07 17:28:48,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:48,341 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 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, 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] [2019-12-07 17:28:48,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:48,542 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:48,543 INFO L82 PathProgramCache]: Analyzing trace with hash 773480895, now seen corresponding path program 1 times [2019-12-07 17:28:48,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:48,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100542951] [2019-12-07 17:28:48,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 11344 backedges. 3050 proven. 0 refuted. 0 times theorem prover too weak. 8294 trivial. 0 not checked. [2019-12-07 17:28:51,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100542951] [2019-12-07 17:28:51,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:51,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:28:51,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273599705] [2019-12-07 17:28:51,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:28:51,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:51,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:28:51,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:51,830 INFO L87 Difference]: Start difference. First operand 4276 states and 4334 transitions. Second operand 7 states. [2019-12-07 17:28:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:52,215 INFO L93 Difference]: Finished difference Result 7353 states and 7457 transitions. [2019-12-07 17:28:52,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:28:52,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1892 [2019-12-07 17:28:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:52,218 INFO L225 Difference]: With dead ends: 7353 [2019-12-07 17:28:52,218 INFO L226 Difference]: Without dead ends: 4098 [2019-12-07 17:28:52,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-12-07 17:28:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2019-12-07 17:28:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-12-07 17:28:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4149 transitions. [2019-12-07 17:28:52,243 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4149 transitions. Word has length 1892 [2019-12-07 17:28:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:52,244 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4149 transitions. [2019-12-07 17:28:52,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:28:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4149 transitions. [2019-12-07 17:28:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2025 [2019-12-07 17:28:52,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:52,263 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:52,263 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:52,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1727252823, now seen corresponding path program 1 times [2019-12-07 17:28:52,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:52,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60860458] [2019-12-07 17:28:52,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 13033 backedges. 1789 proven. 0 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-12-07 17:28:54,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60860458] [2019-12-07 17:28:54,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:54,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:28:54,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516122894] [2019-12-07 17:28:54,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:28:54,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:54,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:28:54,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:54,486 INFO L87 Difference]: Start difference. First operand 4098 states and 4149 transitions. Second operand 5 states. [2019-12-07 17:28:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:54,975 INFO L93 Difference]: Finished difference Result 4098 states and 4149 transitions. [2019-12-07 17:28:54,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:28:54,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2024 [2019-12-07 17:28:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:54,976 INFO L225 Difference]: With dead ends: 4098 [2019-12-07 17:28:54,976 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:28:54,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-07 17:28:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:28:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:28:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:28:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:28:54,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2024 [2019-12-07 17:28:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:54,978 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:28:54,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:28:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:28:54,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:28:54,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:28:55,230 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 215 [2019-12-07 17:28:55,447 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 220 [2019-12-07 17:28:56,311 WARN L192 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 84 [2019-12-07 17:28:57,465 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 203 DAG size of output: 84 [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,468 INFO L246 CegarLoopResult]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-12-07 17:28:57,469 INFO L246 CegarLoopResult]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-12-07 17:28:57,470 INFO L246 CegarLoopResult]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-12-07 17:28:57,471 INFO L246 CegarLoopResult]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-12-07 17:28:57,472 INFO L246 CegarLoopResult]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-12-07 17:28:57,473 INFO L246 CegarLoopResult]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-12-07 17:28:57,474 INFO L246 CegarLoopResult]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,475 INFO L246 CegarLoopResult]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L242 CegarLoopResult]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse9 (<= ~a12~0 11)) (.cse15 (+ ~a12~0 43)) (.cse2 (= ~a15~0 8)) (.cse16 (<= ~a12~0 599999)) (.cse8 (= ~a15~0 9)) (.cse4 (<= ~a12~0 586307)) (.cse0 (= ~a21~0 6)) (.cse17 (= ~a15~0 5)) (.cse7 (= ~a21~0 10)) (.cse10 (= ~a21~0 8)) (.cse11 (= ~a15~0 7)) (.cse5 (<= ~a15~0 6)) (.cse12 (= ~a21~0 7)) (.cse14 (<= ~a12~0 80)) (.cse1 (< 11 ~a12~0)) (.cse3 (= ~a24~0 1)) (.cse13 (<= ~a15~0 8)) (.cse6 (= ~a21~0 9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6) (and .cse3 .cse7 .cse8 .cse9) (and .cse3 .cse10 .cse8 .cse9) (and .cse11 .cse3 (not .cse7)) (and .cse5 .cse10) (and .cse3 .cse12 .cse9 .cse13) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse14 .cse2 .cse3 (< 0 .cse15) .cse6) (and .cse5 (<= .cse15 0)) (and .cse2 .cse16 .cse3 .cse7) (and .cse11 .cse3 (<= (+ ~a12~0 49) 0)) (and .cse0 .cse3 (= ~a15~0 6)) (and .cse1 .cse16 .cse3 .cse8) (and .cse3 .cse7 .cse17 .cse4) (and .cse0 .cse3 .cse17) (and .cse14 .cse5 .cse7) (and .cse1 (exists ((v_~a12~0_435 Int)) (let ((.cse18 (+ v_~a12~0_435 366333))) (and (<= v_~a12~0_435 80) (< 11 v_~a12~0_435) (<= ~a12~0 (div .cse18 5)) (<= 0 .cse18)))) .cse3 .cse10 .cse13) (and .cse11 .cse1 .cse3) (and .cse14 .cse5 .cse12) (and .cse14 .cse1 .cse3 .cse13 .cse6))) [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L249 CegarLoopResult]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 17:28:57,476 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L246 CegarLoopResult]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-12-07 17:28:57,477 INFO L242 CegarLoopResult]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse9 (<= ~a12~0 11)) (.cse15 (+ ~a12~0 43)) (.cse2 (= ~a15~0 8)) (.cse16 (<= ~a12~0 599999)) (.cse8 (= ~a15~0 9)) (.cse4 (<= ~a12~0 586307)) (.cse0 (= ~a21~0 6)) (.cse17 (= ~a15~0 5)) (.cse7 (= ~a21~0 10)) (.cse10 (= ~a21~0 8)) (.cse11 (= ~a15~0 7)) (.cse5 (<= ~a15~0 6)) (.cse12 (= ~a21~0 7)) (.cse14 (<= ~a12~0 80)) (.cse1 (< 11 ~a12~0)) (.cse3 (= ~a24~0 1)) (.cse13 (<= ~a15~0 8)) (.cse6 (= ~a21~0 9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6) (and .cse3 .cse7 .cse8 .cse9) (and .cse3 .cse10 .cse8 .cse9) (and .cse11 .cse3 (not .cse7)) (and .cse5 .cse10) (and .cse3 .cse12 .cse9 .cse13) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse14 .cse2 .cse3 (< 0 .cse15) .cse6) (and .cse5 (<= .cse15 0)) (and .cse2 .cse16 .cse3 .cse7) (and .cse11 .cse3 (<= (+ ~a12~0 49) 0)) (and .cse0 .cse3 (= ~a15~0 6)) (and .cse1 .cse16 .cse3 .cse8) (and .cse3 .cse7 .cse17 .cse4) (and .cse0 .cse3 .cse17) (and .cse14 .cse5 .cse7) (and .cse1 (exists ((v_~a12~0_435 Int)) (let ((.cse18 (+ v_~a12~0_435 366333))) (and (<= v_~a12~0_435 80) (< 11 v_~a12~0_435) (<= ~a12~0 (div .cse18 5)) (<= 0 .cse18)))) .cse3 .cse10 .cse13) (and .cse11 .cse1 .cse3) (and .cse14 .cse5 .cse12) (and .cse14 .cse1 .cse3 .cse13 .cse6))) [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L885(line 885) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-12-07 17:28:57,478 INFO L246 CegarLoopResult]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-12-07 17:28:57,479 INFO L246 CegarLoopResult]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-12-07 17:28:57,480 INFO L246 CegarLoopResult]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-12-07 17:28:57,480 INFO L246 CegarLoopResult]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-12-07 17:28:57,480 INFO L246 CegarLoopResult]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-12-07 17:28:57,480 INFO L246 CegarLoopResult]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,480 INFO L246 CegarLoopResult]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,480 INFO L246 CegarLoopResult]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:57,480 INFO L246 CegarLoopResult]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-12-07 17:28:57,480 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 17:28:57,480 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 17:28:57,480 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 17:28:57,480 INFO L246 CegarLoopResult]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-12-07 17:28:57,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:28:57 BoogieIcfgContainer [2019-12-07 17:28:57,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:28:57,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:28:57,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:28:57,510 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:28:57,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:28:01" (3/4) ... [2019-12-07 17:28:57,513 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:28:57,532 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 17:28:57,533 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:28:57,552 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a21 == 6 && 11 < a12) && a15 == 8) && a24 == 1) && a12 <= 586307) || (a15 <= 6 && a21 == 9)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11)) || ((a15 == 7 && a24 == 1) && !(a21 == 10))) || (a15 <= 6 && a21 == 8)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || (((((!(5 == input) && a12 <= 80) && a15 == 8) && a24 == 1) && 0 < a12 + 43) && a21 == 9)) || (a15 <= 6 && a12 + 43 <= 0)) || (((a15 == 8 && a12 <= 599999) && a24 == 1) && a21 == 10)) || ((a15 == 7 && a24 == 1) && a12 + 49 <= 0)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((11 < a12 && a12 <= 599999) && a24 == 1) && a15 == 9)) || (((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((a12 <= 80 && a15 <= 6) && a21 == 10)) || ((((11 < a12 && (\exists v_~a12~0_435 : int :: ((v_~a12~0_435 <= 80 && 11 < v_~a12~0_435) && a12 <= (v_~a12~0_435 + 366333) / 5) && 0 <= v_~a12~0_435 + 366333)) && a24 == 1) && a21 == 8) && a15 <= 8)) || ((a15 == 7 && 11 < a12) && a24 == 1)) || ((a12 <= 80 && a15 <= 6) && a21 == 7)) || ((((a12 <= 80 && 11 < a12) && a24 == 1) && a15 <= 8) && a21 == 9) [2019-12-07 17:28:57,554 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a21 == 6 && 11 < a12) && a15 == 8) && a24 == 1) && a12 <= 586307) || (a15 <= 6 && a21 == 9)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11)) || ((a15 == 7 && a24 == 1) && !(a21 == 10))) || (a15 <= 6 && a21 == 8)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || (((((!(5 == input) && a12 <= 80) && a15 == 8) && a24 == 1) && 0 < a12 + 43) && a21 == 9)) || (a15 <= 6 && a12 + 43 <= 0)) || (((a15 == 8 && a12 <= 599999) && a24 == 1) && a21 == 10)) || ((a15 == 7 && a24 == 1) && a12 + 49 <= 0)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((11 < a12 && a12 <= 599999) && a24 == 1) && a15 == 9)) || (((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((a12 <= 80 && a15 <= 6) && a21 == 10)) || ((((11 < a12 && (\exists v_~a12~0_435 : int :: ((v_~a12~0_435 <= 80 && 11 < v_~a12~0_435) && a12 <= (v_~a12~0_435 + 366333) / 5) && 0 <= v_~a12~0_435 + 366333)) && a24 == 1) && a21 == 8) && a15 <= 8)) || ((a15 == 7 && 11 < a12) && a24 == 1)) || ((a12 <= 80 && a15 <= 6) && a21 == 7)) || ((((a12 <= 80 && 11 < a12) && a24 == 1) && a15 <= 8) && a21 == 9) [2019-12-07 17:28:57,613 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_09607d06-1675-4278-97b1-bf32692bca6d/bin/uautomizer/witness.graphml [2019-12-07 17:28:57,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:28:57,614 INFO L168 Benchmark]: Toolchain (without parser) took 57463.03 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 932.8 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 821.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:57,614 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:28:57,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 932.8 MB in the beginning and 1.0 GB in the end (delta: -115.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:57,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:57,615 INFO L168 Benchmark]: Boogie Preprocessor took 44.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:57,615 INFO L168 Benchmark]: RCFGBuilder took 818.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 897.2 MB in the end (delta: 126.9 MB). Peak memory consumption was 126.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:57,615 INFO L168 Benchmark]: TraceAbstraction took 56025.81 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 897.2 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 685.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:57,616 INFO L168 Benchmark]: Witness Printer took 103.56 ms. Allocated memory is still 3.9 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:57,617 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 932.8 MB in the beginning and 1.0 GB in the end (delta: -115.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 818.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 897.2 MB in the end (delta: 126.9 MB). Peak memory consumption was 126.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56025.81 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 897.2 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 685.7 MB. Max. memory is 11.5 GB. * Witness Printer took 103.56 ms. Allocated memory is still 3.9 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: 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: 880]: Loop Invariant [2019-12-07 17:28:57,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a21 == 6 && 11 < a12) && a15 == 8) && a24 == 1) && a12 <= 586307) || (a15 <= 6 && a21 == 9)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11)) || ((a15 == 7 && a24 == 1) && !(a21 == 10))) || (a15 <= 6 && a21 == 8)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || (((((!(5 == input) && a12 <= 80) && a15 == 8) && a24 == 1) && 0 < a12 + 43) && a21 == 9)) || (a15 <= 6 && a12 + 43 <= 0)) || (((a15 == 8 && a12 <= 599999) && a24 == 1) && a21 == 10)) || ((a15 == 7 && a24 == 1) && a12 + 49 <= 0)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((11 < a12 && a12 <= 599999) && a24 == 1) && a15 == 9)) || (((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((a12 <= 80 && a15 <= 6) && a21 == 10)) || ((((11 < a12 && (\exists v_~a12~0_435 : int :: ((v_~a12~0_435 <= 80 && 11 < v_~a12~0_435) && a12 <= (v_~a12~0_435 + 366333) / 5) && 0 <= v_~a12~0_435 + 366333)) && a24 == 1) && a21 == 8) && a15 <= 8)) || ((a15 == 7 && 11 < a12) && a24 == 1)) || ((a12 <= 80 && a15 <= 6) && a21 == 7)) || ((((a12 <= 80 && 11 < a12) && a24 == 1) && a15 <= 8) && a21 == 9) - InvariantResult [Line: 20]: Loop Invariant [2019-12-07 17:28:57,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-12-07 17:28:57,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a21 == 6 && 11 < a12) && a15 == 8) && a24 == 1) && a12 <= 586307) || (a15 <= 6 && a21 == 9)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11)) || ((a15 == 7 && a24 == 1) && !(a21 == 10))) || (a15 <= 6 && a21 == 8)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || (((((!(5 == input) && a12 <= 80) && a15 == 8) && a24 == 1) && 0 < a12 + 43) && a21 == 9)) || (a15 <= 6 && a12 + 43 <= 0)) || (((a15 == 8 && a12 <= 599999) && a24 == 1) && a21 == 10)) || ((a15 == 7 && a24 == 1) && a12 + 49 <= 0)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((11 < a12 && a12 <= 599999) && a24 == 1) && a15 == 9)) || (((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((a12 <= 80 && a15 <= 6) && a21 == 10)) || ((((11 < a12 && (\exists v_~a12~0_435 : int :: ((v_~a12~0_435 <= 80 && 11 < v_~a12~0_435) && a12 <= (v_~a12~0_435 + 366333) / 5) && 0 <= v_~a12~0_435 + 366333)) && a24 == 1) && a21 == 8) && a15 <= 8)) || ((a15 == 7 && 11 < a12) && a24 == 1)) || ((a12 <= 80 && a15 <= 6) && a21 == 7)) || ((((a12 <= 80 && 11 < a12) && a24 == 1) && a15 <= 8) && a21 == 9) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 53.4s, OverallIterations: 24, TraceHistogramMax: 17, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 1654 SDtfs, 5896 SDslu, 290 SDs, 0 SdLazy, 20695 SolverSat, 1922 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6179 GetRequests, 6066 SyntacticMatches, 11 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5166occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 6930 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 88 NumberOfFragments, 525 HoareAnnotationTreeSize, 3 FomulaSimplifications, 754219 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 70561 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 29783 NumberOfCodeBlocks, 29783 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 29751 ConstructedInterpolants, 257 QuantifiedInterpolants, 105987262 SizeOfPredicates, 18 NumberOfNonLiveVariables, 7502 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 121671/122556 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...