./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/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 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:48:00,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:48:00,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:48:00,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:48:00,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:48:00,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:48:00,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:48:00,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:48:00,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:48:00,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:48:00,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:48:00,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:48:00,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:48:00,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:48:00,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:48:00,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:48:00,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:48:00,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:48:00,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:48:00,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:48:00,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:48:00,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:48:00,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:48:00,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:48:00,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:48:00,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:48:00,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:48:00,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:48:00,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:48:00,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:48:00,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:48:00,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:48:00,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:48:00,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:48:00,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:48:00,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:48:00,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:48:00,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:48:00,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:48:00,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:48:00,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:48:00,535 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:48:00,555 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:48:00,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:48:00,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:48:00,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:48:00,557 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:48:00,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:48:00,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:48:00,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:48:00,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:48:00,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:48:00,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:48:00,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:48:00,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:48:00,559 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:48:00,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:48:00,560 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:48:00,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:48:00,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:48:00,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:48:00,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:48:00,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:48:00,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:48:00,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:48:00,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:48:00,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:48:00,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:48:00,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:48:00,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:48:00,563 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_9913162d-7645-4315-be3a-2562e96381f3/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 -> 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 [2019-11-15 20:48:00,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:48:00,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:48:00,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:48:00,626 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:48:00,627 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:48:00,628 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2019-11-15 20:48:00,677 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/data/e96c8fa5a/0eaf97cfc6a7430faff3f9fd42e4f72a/FLAG42e3fed17 [2019-11-15 20:48:01,167 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:48:01,167 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2019-11-15 20:48:01,186 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/data/e96c8fa5a/0eaf97cfc6a7430faff3f9fd42e4f72a/FLAG42e3fed17 [2019-11-15 20:48:01,652 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/data/e96c8fa5a/0eaf97cfc6a7430faff3f9fd42e4f72a [2019-11-15 20:48:01,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:48:01,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:48:01,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:48:01,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:48:01,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:48:01,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:48:01" (1/1) ... [2019-11-15 20:48:01,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2258f497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:01, skipping insertion in model container [2019-11-15 20:48:01,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:48:01" (1/1) ... [2019-11-15 20:48:01,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:48:01,726 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:48:02,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:48:02,113 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:48:02,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:48:02,271 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:48:02,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02 WrapperNode [2019-11-15 20:48:02,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:48:02,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:48:02,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:48:02,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:48:02,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02" (1/1) ... [2019-11-15 20:48:02,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02" (1/1) ... [2019-11-15 20:48:02,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:48:02,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:48:02,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:48:02,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:48:02,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02" (1/1) ... [2019-11-15 20:48:02,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02" (1/1) ... [2019-11-15 20:48:02,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02" (1/1) ... [2019-11-15 20:48:02,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02" (1/1) ... [2019-11-15 20:48:02,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02" (1/1) ... [2019-11-15 20:48:02,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02" (1/1) ... [2019-11-15 20:48:02,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02" (1/1) ... [2019-11-15 20:48:02,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:48:02,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:48:02,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:48:02,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:48:02,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:48:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:48:02,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:48:03,771 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:48:03,772 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:48:03,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:48:03 BoogieIcfgContainer [2019-11-15 20:48:03,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:48:03,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:48:03,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:48:03,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:48:03,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:48:01" (1/3) ... [2019-11-15 20:48:03,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d0a42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:48:03, skipping insertion in model container [2019-11-15 20:48:03,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:02" (2/3) ... [2019-11-15 20:48:03,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d0a42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:48:03, skipping insertion in model container [2019-11-15 20:48:03,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:48:03" (3/3) ... [2019-11-15 20:48:03,781 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label29.c [2019-11-15 20:48:03,789 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:48:03,797 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:48:03,807 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:48:03,850 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:48:03,850 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:48:03,850 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:48:03,850 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:48:03,851 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:48:03,851 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:48:03,851 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:48:03,851 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:48:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-15 20:48:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 20:48:03,890 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:03,891 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:03,893 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:03,898 INFO L82 PathProgramCache]: Analyzing trace with hash 620620582, now seen corresponding path program 1 times [2019-11-15 20:48:03,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:03,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132591358] [2019-11-15 20:48:03,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:03,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:03,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:04,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132591358] [2019-11-15 20:48:04,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:04,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:04,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378492299] [2019-11-15 20:48:04,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:48:04,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:04,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:48:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:48:04,359 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-15 20:48:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:05,573 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-15 20:48:05,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:48:05,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 20:48:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:05,598 INFO L225 Difference]: With dead ends: 662 [2019-11-15 20:48:05,601 INFO L226 Difference]: Without dead ends: 397 [2019-11-15 20:48:05,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:48:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-15 20:48:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-15 20:48:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-15 20:48:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-11-15 20:48:05,695 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 101 [2019-11-15 20:48:05,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:05,696 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-11-15 20:48:05,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:48:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-11-15 20:48:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-15 20:48:05,711 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:05,711 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:05,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1432944013, now seen corresponding path program 1 times [2019-11-15 20:48:05,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:05,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971639402] [2019-11-15 20:48:05,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:05,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:05,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:05,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971639402] [2019-11-15 20:48:05,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:05,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:48:05,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411711859] [2019-11-15 20:48:05,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:48:05,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:05,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:48:05,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:48:05,956 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-11-15 20:48:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:06,810 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-11-15 20:48:06,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:48:06,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-15 20:48:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:06,818 INFO L225 Difference]: With dead ends: 1447 [2019-11-15 20:48:06,818 INFO L226 Difference]: Without dead ends: 1052 [2019-11-15 20:48:06,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:48:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-15 20:48:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-11-15 20:48:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-15 20:48:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-11-15 20:48:06,861 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 108 [2019-11-15 20:48:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:06,862 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-11-15 20:48:06,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:48:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-11-15 20:48:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 20:48:06,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:06,865 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:06,865 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:06,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:06,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1541134986, now seen corresponding path program 1 times [2019-11-15 20:48:06,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:06,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990366811] [2019-11-15 20:48:06,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:06,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:06,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:06,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990366811] [2019-11-15 20:48:06,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:06,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:06,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400001611] [2019-11-15 20:48:06,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:48:06,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:06,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:48:06,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:48:06,963 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-11-15 20:48:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:07,637 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-11-15 20:48:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:48:07,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-15 20:48:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:07,642 INFO L225 Difference]: With dead ends: 1578 [2019-11-15 20:48:07,642 INFO L226 Difference]: Without dead ends: 790 [2019-11-15 20:48:07,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:48:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-15 20:48:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-15 20:48:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-15 20:48:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-11-15 20:48:07,677 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 122 [2019-11-15 20:48:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:07,677 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-11-15 20:48:07,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:48:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-11-15 20:48:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 20:48:07,681 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:07,681 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:07,681 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:07,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1660180891, now seen corresponding path program 1 times [2019-11-15 20:48:07,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:07,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345969104] [2019-11-15 20:48:07,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:07,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:07,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:07,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345969104] [2019-11-15 20:48:07,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:07,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:07,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663288966] [2019-11-15 20:48:07,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:07,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:07,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:07,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:07,769 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-11-15 20:48:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:08,226 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-11-15 20:48:08,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:08,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-15 20:48:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:08,235 INFO L225 Difference]: With dead ends: 2233 [2019-11-15 20:48:08,236 INFO L226 Difference]: Without dead ends: 1445 [2019-11-15 20:48:08,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:08,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-15 20:48:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-15 20:48:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-15 20:48:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1373 transitions. [2019-11-15 20:48:08,273 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1373 transitions. Word has length 123 [2019-11-15 20:48:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:08,274 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1373 transitions. [2019-11-15 20:48:08,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1373 transitions. [2019-11-15 20:48:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 20:48:08,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:08,279 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:08,279 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:08,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:08,279 INFO L82 PathProgramCache]: Analyzing trace with hash -767786909, now seen corresponding path program 1 times [2019-11-15 20:48:08,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:08,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768549168] [2019-11-15 20:48:08,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:08,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:08,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:48:08,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768549168] [2019-11-15 20:48:08,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:08,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:08,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468085762] [2019-11-15 20:48:08,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:08,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:08,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:08,364 INFO L87 Difference]: Start difference. First operand 1183 states and 1373 transitions. Second operand 3 states. [2019-11-15 20:48:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:08,891 INFO L93 Difference]: Finished difference Result 3150 states and 3672 transitions. [2019-11-15 20:48:08,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:08,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-15 20:48:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:08,901 INFO L225 Difference]: With dead ends: 3150 [2019-11-15 20:48:08,901 INFO L226 Difference]: Without dead ends: 1969 [2019-11-15 20:48:08,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-15 20:48:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-15 20:48:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-15 20:48:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1841 transitions. [2019-11-15 20:48:08,943 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1841 transitions. Word has length 127 [2019-11-15 20:48:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:08,944 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1841 transitions. [2019-11-15 20:48:08,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1841 transitions. [2019-11-15 20:48:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-15 20:48:08,947 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:08,947 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:08,948 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:08,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:08,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1109954633, now seen corresponding path program 1 times [2019-11-15 20:48:08,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:08,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943131088] [2019-11-15 20:48:08,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:08,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:08,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 20:48:09,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943131088] [2019-11-15 20:48:09,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:09,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:09,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14819116] [2019-11-15 20:48:09,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:09,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:09,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:09,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:09,005 INFO L87 Difference]: Start difference. First operand 1576 states and 1841 transitions. Second operand 3 states. [2019-11-15 20:48:09,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:09,420 INFO L93 Difference]: Finished difference Result 3281 states and 3832 transitions. [2019-11-15 20:48:09,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:09,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-15 20:48:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:09,429 INFO L225 Difference]: With dead ends: 3281 [2019-11-15 20:48:09,429 INFO L226 Difference]: Without dead ends: 1707 [2019-11-15 20:48:09,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-15 20:48:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-11-15 20:48:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-15 20:48:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1841 transitions. [2019-11-15 20:48:09,470 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1841 transitions. Word has length 129 [2019-11-15 20:48:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:09,470 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1841 transitions. [2019-11-15 20:48:09,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1841 transitions. [2019-11-15 20:48:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 20:48:09,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:09,473 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:09,474 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:09,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1564517898, now seen corresponding path program 1 times [2019-11-15 20:48:09,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:09,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238996372] [2019-11-15 20:48:09,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:09,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:09,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:09,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238996372] [2019-11-15 20:48:09,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:09,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:09,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472141016] [2019-11-15 20:48:09,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:09,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:09,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:09,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:09,542 INFO L87 Difference]: Start difference. First operand 1576 states and 1841 transitions. Second operand 3 states. [2019-11-15 20:48:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:10,011 INFO L93 Difference]: Finished difference Result 3543 states and 4110 transitions. [2019-11-15 20:48:10,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:10,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-15 20:48:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:10,021 INFO L225 Difference]: With dead ends: 3543 [2019-11-15 20:48:10,021 INFO L226 Difference]: Without dead ends: 1969 [2019-11-15 20:48:10,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-15 20:48:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-15 20:48:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-15 20:48:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2124 transitions. [2019-11-15 20:48:10,060 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2124 transitions. Word has length 130 [2019-11-15 20:48:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:10,061 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2124 transitions. [2019-11-15 20:48:10,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2124 transitions. [2019-11-15 20:48:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-15 20:48:10,064 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:10,065 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:10,065 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:10,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1099746882, now seen corresponding path program 1 times [2019-11-15 20:48:10,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:10,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228904516] [2019-11-15 20:48:10,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:10,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:10,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:10,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228904516] [2019-11-15 20:48:10,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:10,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:48:10,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037579862] [2019-11-15 20:48:10,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:48:10,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:10,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:48:10,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:48:10,227 INFO L87 Difference]: Start difference. First operand 1838 states and 2124 transitions. Second operand 8 states. [2019-11-15 20:48:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:11,358 INFO L93 Difference]: Finished difference Result 3847 states and 4438 transitions. [2019-11-15 20:48:11,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:48:11,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-11-15 20:48:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:11,371 INFO L225 Difference]: With dead ends: 3847 [2019-11-15 20:48:11,372 INFO L226 Difference]: Without dead ends: 2142 [2019-11-15 20:48:11,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:48:11,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-15 20:48:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1838. [2019-11-15 20:48:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-15 20:48:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2112 transitions. [2019-11-15 20:48:11,417 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2112 transitions. Word has length 134 [2019-11-15 20:48:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:11,418 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2112 transitions. [2019-11-15 20:48:11,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:48:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2112 transitions. [2019-11-15 20:48:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-15 20:48:11,422 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:11,422 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:11,422 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1909853781, now seen corresponding path program 1 times [2019-11-15 20:48:11,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:11,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881240607] [2019-11-15 20:48:11,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:11,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:11,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 20:48:11,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881240607] [2019-11-15 20:48:11,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:11,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:11,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084179422] [2019-11-15 20:48:11,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:11,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:11,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:11,490 INFO L87 Difference]: Start difference. First operand 1838 states and 2112 transitions. Second operand 3 states. [2019-11-15 20:48:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:11,949 INFO L93 Difference]: Finished difference Result 3674 states and 4220 transitions. [2019-11-15 20:48:11,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:11,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-15 20:48:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:11,959 INFO L225 Difference]: With dead ends: 3674 [2019-11-15 20:48:11,959 INFO L226 Difference]: Without dead ends: 1838 [2019-11-15 20:48:11,962 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-15 20:48:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-15 20:48:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-15 20:48:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1999 transitions. [2019-11-15 20:48:12,007 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1999 transitions. Word has length 157 [2019-11-15 20:48:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:12,007 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1999 transitions. [2019-11-15 20:48:12,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:12,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1999 transitions. [2019-11-15 20:48:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 20:48:12,012 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:12,013 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:12,013 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:12,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:12,013 INFO L82 PathProgramCache]: Analyzing trace with hash -221184622, now seen corresponding path program 1 times [2019-11-15 20:48:12,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:12,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602826506] [2019-11-15 20:48:12,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:12,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:12,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:12,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602826506] [2019-11-15 20:48:12,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:12,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 20:48:12,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337633168] [2019-11-15 20:48:12,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 20:48:12,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:12,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 20:48:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:48:12,872 INFO L87 Difference]: Start difference. First operand 1838 states and 1999 transitions. Second operand 13 states. [2019-11-15 20:48:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:14,308 INFO L93 Difference]: Finished difference Result 3732 states and 4088 transitions. [2019-11-15 20:48:14,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:48:14,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2019-11-15 20:48:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:14,322 INFO L225 Difference]: With dead ends: 3732 [2019-11-15 20:48:14,322 INFO L226 Difference]: Without dead ends: 2027 [2019-11-15 20:48:14,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:48:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-11-15 20:48:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1765. [2019-11-15 20:48:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-15 20:48:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1916 transitions. [2019-11-15 20:48:14,366 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1916 transitions. Word has length 167 [2019-11-15 20:48:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:14,366 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 1916 transitions. [2019-11-15 20:48:14,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 20:48:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1916 transitions. [2019-11-15 20:48:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 20:48:14,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:14,372 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:14,372 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:14,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1527065083, now seen corresponding path program 1 times [2019-11-15 20:48:14,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:14,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555602943] [2019-11-15 20:48:14,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:14,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:14,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 20:48:14,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555602943] [2019-11-15 20:48:14,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:14,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:14,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047365263] [2019-11-15 20:48:14,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:14,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:14,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:14,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:14,468 INFO L87 Difference]: Start difference. First operand 1765 states and 1916 transitions. Second operand 3 states. [2019-11-15 20:48:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:14,838 INFO L93 Difference]: Finished difference Result 3528 states and 3830 transitions. [2019-11-15 20:48:14,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:14,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-15 20:48:14,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:14,848 INFO L225 Difference]: With dead ends: 3528 [2019-11-15 20:48:14,848 INFO L226 Difference]: Without dead ends: 1765 [2019-11-15 20:48:14,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-15 20:48:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1634. [2019-11-15 20:48:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-11-15 20:48:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1762 transitions. [2019-11-15 20:48:14,882 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1762 transitions. Word has length 195 [2019-11-15 20:48:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:14,882 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 1762 transitions. [2019-11-15 20:48:14,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1762 transitions. [2019-11-15 20:48:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 20:48:14,887 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:14,888 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:14,888 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:14,888 INFO L82 PathProgramCache]: Analyzing trace with hash 792554223, now seen corresponding path program 1 times [2019-11-15 20:48:14,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:14,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333300351] [2019-11-15 20:48:14,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:14,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:14,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 20:48:15,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333300351] [2019-11-15 20:48:15,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:15,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:48:15,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971146960] [2019-11-15 20:48:15,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:48:15,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:15,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:48:15,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:48:15,055 INFO L87 Difference]: Start difference. First operand 1634 states and 1762 transitions. Second operand 6 states. [2019-11-15 20:48:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:15,612 INFO L93 Difference]: Finished difference Result 3423 states and 3704 transitions. [2019-11-15 20:48:15,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:48:15,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-11-15 20:48:15,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:15,621 INFO L225 Difference]: With dead ends: 3423 [2019-11-15 20:48:15,621 INFO L226 Difference]: Without dead ends: 1922 [2019-11-15 20:48:15,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:48:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2019-11-15 20:48:15,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1896. [2019-11-15 20:48:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-11-15 20:48:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2020 transitions. [2019-11-15 20:48:15,661 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2020 transitions. Word has length 239 [2019-11-15 20:48:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:15,662 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2020 transitions. [2019-11-15 20:48:15,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:48:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2020 transitions. [2019-11-15 20:48:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-15 20:48:15,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:15,668 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:15,668 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:15,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:15,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1426430283, now seen corresponding path program 1 times [2019-11-15 20:48:15,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:15,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466032162] [2019-11-15 20:48:15,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:15,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:15,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-15 20:48:15,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466032162] [2019-11-15 20:48:15,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:15,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:48:15,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957992103] [2019-11-15 20:48:15,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:48:15,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:15,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:48:15,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:48:15,923 INFO L87 Difference]: Start difference. First operand 1896 states and 2020 transitions. Second operand 5 states. [2019-11-15 20:48:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:16,733 INFO L93 Difference]: Finished difference Result 3790 states and 4036 transitions. [2019-11-15 20:48:16,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:48:16,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2019-11-15 20:48:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:16,740 INFO L225 Difference]: With dead ends: 3790 [2019-11-15 20:48:16,740 INFO L226 Difference]: Without dead ends: 1765 [2019-11-15 20:48:16,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:48:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-15 20:48:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2019-11-15 20:48:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-15 20:48:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1882 transitions. [2019-11-15 20:48:16,775 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1882 transitions. Word has length 262 [2019-11-15 20:48:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:16,775 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 1882 transitions. [2019-11-15 20:48:16,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:48:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1882 transitions. [2019-11-15 20:48:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-11-15 20:48:16,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:16,782 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:16,782 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:16,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:16,783 INFO L82 PathProgramCache]: Analyzing trace with hash -42906621, now seen corresponding path program 1 times [2019-11-15 20:48:16,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:16,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826402871] [2019-11-15 20:48:16,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:16,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:16,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-15 20:48:17,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826402871] [2019-11-15 20:48:17,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:17,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:48:17,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996681126] [2019-11-15 20:48:17,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:48:17,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:17,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:48:17,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:48:17,215 INFO L87 Difference]: Start difference. First operand 1765 states and 1882 transitions. Second operand 6 states. [2019-11-15 20:48:17,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:17,969 INFO L93 Difference]: Finished difference Result 3467 states and 3713 transitions. [2019-11-15 20:48:17,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:48:17,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2019-11-15 20:48:17,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:17,970 INFO L225 Difference]: With dead ends: 3467 [2019-11-15 20:48:17,970 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:48:17,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:48:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:48:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:48:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:48:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:48:17,975 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2019-11-15 20:48:17,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:17,975 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:48:17,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:48:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:48:17,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:48:17,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:48:18,409 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-11-15 20:48:18,701 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-11-15 20:48:18,703 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-15 20:48:18,703 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-15 20:48:18,703 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,703 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,703 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,703 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,704 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-15 20:48:18,705 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-15 20:48:18,706 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-15 20:48:18,707 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-15 20:48:18,707 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-15 20:48:18,707 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-15 20:48:18,707 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-15 20:48:18,707 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= 15 ~a8~0))) (let ((.cse11 (not .cse5)) (.cse4 (= ~a21~0 1))) (let ((.cse0 (= ~a20~0 1)) (.cse2 (not (= ~a7~0 1))) (.cse10 (= 1 ~a7~0)) (.cse3 (= ~a12~0 8)) (.cse8 (<= ~a17~0 0)) (.cse9 (<= ~a20~0 0)) (.cse7 (= ~a17~0 1)) (.cse6 (= 5 ~a16~0)) (.cse12 (= ~a16~0 4)) (.cse1 (and .cse11 .cse4))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse0) (and .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse3 .cse4) (and .cse2 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse3 .cse8 .cse4 .cse5 .cse9) (and .cse10 .cse11 .cse3) (and .cse2 .cse3 .cse4 .cse5 (not .cse12)) (and .cse10 .cse12 .cse3 .cse8 .cse4 .cse9) (and .cse7 .cse1) (and (and .cse11 .cse6) (not (= ~a8~0 13))) (and .cse12 .cse1))))) [2019-11-15 20:48:18,707 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,708 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,708 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,708 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,708 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,708 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-15 20:48:18,708 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-15 20:48:18,708 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-15 20:48:18,712 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-15 20:48:18,712 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-15 20:48:18,712 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-15 20:48:18,712 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-15 20:48:18,712 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-15 20:48:18,712 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-15 20:48:18,713 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-15 20:48:18,713 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-15 20:48:18,713 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-15 20:48:18,713 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-15 20:48:18,713 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-15 20:48:18,713 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,713 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,713 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,714 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,714 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,714 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-15 20:48:18,714 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-15 20:48:18,714 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-15 20:48:18,714 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-15 20:48:18,714 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-15 20:48:18,714 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-15 20:48:18,715 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-15 20:48:18,715 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-15 20:48:18,715 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-15 20:48:18,715 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,715 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,715 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,715 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,715 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-15 20:48:18,716 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,716 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-15 20:48:18,716 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-15 20:48:18,716 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-15 20:48:18,716 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-15 20:48:18,716 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-15 20:48:18,716 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-15 20:48:18,716 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-15 20:48:18,717 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:48:18,717 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-15 20:48:18,717 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-15 20:48:18,717 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-15 20:48:18,717 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-15 20:48:18,717 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-15 20:48:18,717 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-15 20:48:18,717 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,718 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse5 (= 15 ~a8~0))) (let ((.cse11 (not .cse5)) (.cse4 (= ~a21~0 1))) (let ((.cse0 (= ~a20~0 1)) (.cse2 (not (= ~a7~0 1))) (.cse10 (= 1 ~a7~0)) (.cse3 (= ~a12~0 8)) (.cse8 (<= ~a17~0 0)) (.cse9 (<= ~a20~0 0)) (.cse7 (= ~a17~0 1)) (.cse6 (= 5 ~a16~0)) (.cse12 (= ~a16~0 4)) (.cse1 (and .cse11 .cse4))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse0) (and .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse3 .cse4) (and .cse2 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse3 .cse8 .cse4 .cse5 .cse9) (and .cse10 .cse11 .cse3) (and .cse2 .cse3 .cse4 .cse5 (not .cse12)) (and .cse10 .cse12 .cse3 .cse8 .cse4 .cse9) (and .cse7 .cse1) (and (and .cse11 .cse6) (not (= ~a8~0 13))) (and .cse12 .cse1))))) [2019-11-15 20:48:18,718 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,718 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,718 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,718 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,718 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-15 20:48:18,719 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-15 20:48:18,719 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-15 20:48:18,719 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-15 20:48:18,719 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-15 20:48:18,719 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-15 20:48:18,719 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-15 20:48:18,720 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2019-11-15 20:48:18,720 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-15 20:48:18,720 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,720 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,720 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,720 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,720 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,721 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-15 20:48:18,721 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:48:18,721 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-15 20:48:18,721 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-15 20:48:18,721 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-15 20:48:18,721 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-15 20:48:18,721 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-15 20:48:18,721 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-15 20:48:18,722 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-15 20:48:18,722 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-15 20:48:18,722 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-15 20:48:18,722 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-15 20:48:18,722 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-15 20:48:18,722 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,722 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,722 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,723 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,723 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-15 20:48:18,723 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,723 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,723 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-15 20:48:18,723 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-15 20:48:18,723 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:48:18,723 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-15 20:48:18,723 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-15 20:48:18,724 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-15 20:48:18,724 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-15 20:48:18,724 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-15 20:48:18,724 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-15 20:48:18,724 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-15 20:48:18,724 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-15 20:48:18,724 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-15 20:48:18,724 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-15 20:48:18,725 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,725 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,725 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,725 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,725 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,725 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-15 20:48:18,725 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,725 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-15 20:48:18,726 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-15 20:48:18,726 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-15 20:48:18,726 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-15 20:48:18,726 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-15 20:48:18,726 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-15 20:48:18,726 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-15 20:48:18,726 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-15 20:48:18,726 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-15 20:48:18,727 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-15 20:48:18,727 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-15 20:48:18,727 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:48:18,727 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-15 20:48:18,727 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-15 20:48:18,727 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-15 20:48:18,727 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,727 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,728 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,728 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,728 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,728 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:48:18,728 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-15 20:48:18,728 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-15 20:48:18,728 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-15 20:48:18,728 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-15 20:48:18,729 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-15 20:48:18,729 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-15 20:48:18,729 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-15 20:48:18,729 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-15 20:48:18,729 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-15 20:48:18,729 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-15 20:48:18,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:48:18 BoogieIcfgContainer [2019-11-15 20:48:18,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:48:18,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:48:18,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:48:18,766 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:48:18,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:48:03" (3/4) ... [2019-11-15 20:48:18,769 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:48:18,795 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 20:48:18,796 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:48:18,962 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9913162d-7645-4315-be3a-2562e96381f3/bin/uautomizer/witness.graphml [2019-11-15 20:48:18,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:48:18,963 INFO L168 Benchmark]: Toolchain (without parser) took 17308.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 503.8 MB). Free memory was 940.7 MB in the beginning and 1.3 GB in the end (delta: -333.7 MB). Peak memory consumption was 170.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:18,963 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:48:18,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -216.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:18,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:18,964 INFO L168 Benchmark]: Boogie Preprocessor took 113.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:18,965 INFO L168 Benchmark]: RCFGBuilder took 1314.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:18,965 INFO L168 Benchmark]: TraceAbstraction took 14990.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 318.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -265.4 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:18,965 INFO L168 Benchmark]: Witness Printer took 196.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:18,967 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 616.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -216.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1314.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14990.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 318.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -265.4 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. * Witness Printer took 196.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((a20 == 1 && !(15 == a8) && a21 == 1) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a21 == 1) && 15 == a8) && 5 == a16)) || (((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((((!(a7 == 1) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a20 <= 0)) || ((1 == a7 && !(15 == a8)) && a12 == 8)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((((1 == a7 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (a17 == 1 && !(15 == a8) && a21 == 1)) || ((!(15 == a8) && 5 == a16) && !(a8 == 13))) || (a16 == 4 && !(15 == a8) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((a20 == 1 && !(15 == a8) && a21 == 1) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a21 == 1) && 15 == a8) && 5 == a16)) || (((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((((!(a7 == 1) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a20 <= 0)) || ((1 == a7 && !(15 == a8)) && a12 == 8)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((((1 == a7 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (a17 == 1 && !(15 == a8) && a21 == 1)) || ((!(15 == a8) && 5 == a16) && !(a8 == 13))) || (a16 == 4 && !(15 == a8) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 14.8s, OverallIterations: 14, TraceHistogramMax: 8, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 799 SDtfs, 3379 SDslu, 175 SDs, 0 SdLazy, 8117 SolverSat, 1000 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1896occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 2033 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 357 HoareAnnotationTreeSize, 3 FomulaSimplifications, 17108 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 308 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2267 NumberOfCodeBlocks, 2267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1772182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 1734/1734 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...