./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.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/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c -s /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc1563f4697cf21aca476a1aac04fcd8ee81163f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:25:35,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:35,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:35,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:35,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:35,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:35,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:35,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:35,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:35,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:35,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:35,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:35,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:35,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:35,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:35,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:35,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:35,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:35,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:35,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:35,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:35,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:35,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:35,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:35,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:35,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:35,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:35,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:35,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:35,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:35,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:35,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:35,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:35,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:35,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:35,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:35,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:35,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:35,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:35,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:35,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:35,687 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:25:35,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:35,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:35,711 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:35,711 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:35,712 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:35,712 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:35,712 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:35,712 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:35,712 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:35,712 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:35,713 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:35,713 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:35,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:35,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:35,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:35,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:35,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:35,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:25:35,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:35,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:25:35,715 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:35,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:25:35,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:25:35,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:35,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:35,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:35,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:35,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:35,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:35,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:35,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:25:35,719 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:35,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:35,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:25:35,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:35,720 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan 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 -> Taipan 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 -> cc1563f4697cf21aca476a1aac04fcd8ee81163f [2019-10-22 11:25:35,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:35,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:35,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:35,788 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:35,788 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:35,789 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2019-10-22 11:25:35,849 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/data/a667f4bd2/e4f233621dd446ec9cf102f9475bb7d9/FLAG42e3cd41e [2019-10-22 11:25:36,357 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:36,358 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2019-10-22 11:25:36,371 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/data/a667f4bd2/e4f233621dd446ec9cf102f9475bb7d9/FLAG42e3cd41e [2019-10-22 11:25:36,619 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/data/a667f4bd2/e4f233621dd446ec9cf102f9475bb7d9 [2019-10-22 11:25:36,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:36,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:36,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:36,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:36,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:36,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:36" (1/1) ... [2019-10-22 11:25:36,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed3f563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:36, skipping insertion in model container [2019-10-22 11:25:36,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:36" (1/1) ... [2019-10-22 11:25:36,642 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:36,705 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:37,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:37,143 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:37,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:37,311 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:37,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37 WrapperNode [2019-10-22 11:25:37,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:37,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:37,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:37,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:37,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37" (1/1) ... [2019-10-22 11:25:37,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37" (1/1) ... [2019-10-22 11:25:37,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:37,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:37,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:37,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:37,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37" (1/1) ... [2019-10-22 11:25:37,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37" (1/1) ... [2019-10-22 11:25:37,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37" (1/1) ... [2019-10-22 11:25:37,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37" (1/1) ... [2019-10-22 11:25:37,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37" (1/1) ... [2019-10-22 11:25:37,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37" (1/1) ... [2019-10-22 11:25:37,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37" (1/1) ... [2019-10-22 11:25:37,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:37,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:37,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:37,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:37,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/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-10-22 11:25:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:37,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:38,695 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:38,696 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:25:38,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:38 BoogieIcfgContainer [2019-10-22 11:25:38,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:38,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:38,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:38,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:38,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:36" (1/3) ... [2019-10-22 11:25:38,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20645e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:38, skipping insertion in model container [2019-10-22 11:25:38,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:37" (2/3) ... [2019-10-22 11:25:38,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20645e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:38, skipping insertion in model container [2019-10-22 11:25:38,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:38" (3/3) ... [2019-10-22 11:25:38,706 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label30.c [2019-10-22 11:25:38,715 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:38,723 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:25:38,737 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:25:38,774 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:38,780 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:38,780 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:38,780 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:38,780 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:38,781 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:38,781 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:38,781 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 11:25:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 11:25:38,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:38,820 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:38,821 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1318724346, now seen corresponding path program 1 times [2019-10-22 11:25:38,835 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:38,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930674063] [2019-10-22 11:25:38,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:38,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:38,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:39,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930674063] [2019-10-22 11:25:39,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:39,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:39,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431470051] [2019-10-22 11:25:39,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:39,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:39,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:39,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:39,286 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-10-22 11:25:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:40,077 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-10-22 11:25:40,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:40,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-22 11:25:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:40,095 INFO L225 Difference]: With dead ends: 528 [2019-10-22 11:25:40,096 INFO L226 Difference]: Without dead ends: 266 [2019-10-22 11:25:40,099 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-10-22 11:25:40,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-22 11:25:40,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-10-22 11:25:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-22 11:25:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2019-10-22 11:25:40,163 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 125 [2019-10-22 11:25:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:40,164 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2019-10-22 11:25:40,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2019-10-22 11:25:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-22 11:25:40,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:40,168 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:40,168 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:40,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1866428878, now seen corresponding path program 1 times [2019-10-22 11:25:40,169 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:40,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592320628] [2019-10-22 11:25:40,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:40,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:40,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:40,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592320628] [2019-10-22 11:25:40,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:40,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:40,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046400575] [2019-10-22 11:25:40,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:40,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:40,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:40,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:40,333 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand 3 states. [2019-10-22 11:25:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:40,772 INFO L93 Difference]: Finished difference Result 792 states and 1117 transitions. [2019-10-22 11:25:40,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:40,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-10-22 11:25:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:40,779 INFO L225 Difference]: With dead ends: 792 [2019-10-22 11:25:40,779 INFO L226 Difference]: Without dead ends: 528 [2019-10-22 11:25:40,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-10-22 11:25:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-10-22 11:25:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-10-22 11:25:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2019-10-22 11:25:40,812 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 129 [2019-10-22 11:25:40,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:40,814 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2019-10-22 11:25:40,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2019-10-22 11:25:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-22 11:25:40,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:40,820 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:40,820 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:40,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:40,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1624585415, now seen corresponding path program 1 times [2019-10-22 11:25:40,820 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:40,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200112470] [2019-10-22 11:25:40,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:40,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:40,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:25:40,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200112470] [2019-10-22 11:25:40,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:40,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:40,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042370954] [2019-10-22 11:25:40,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:40,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:40,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:40,902 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand 3 states. [2019-10-22 11:25:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:41,299 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2019-10-22 11:25:41,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:41,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-22 11:25:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:41,302 INFO L225 Difference]: With dead ends: 1316 [2019-10-22 11:25:41,303 INFO L226 Difference]: Without dead ends: 790 [2019-10-22 11:25:41,304 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-10-22 11:25:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-22 11:25:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-10-22 11:25:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-22 11:25:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-10-22 11:25:41,329 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 148 [2019-10-22 11:25:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:41,330 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-10-22 11:25:41,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-10-22 11:25:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-22 11:25:41,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:41,333 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 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-10-22 11:25:41,333 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:41,334 INFO L82 PathProgramCache]: Analyzing trace with hash 130660739, now seen corresponding path program 1 times [2019-10-22 11:25:41,334 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:41,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207995643] [2019-10-22 11:25:41,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:41,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 11:25:41,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207995643] [2019-10-22 11:25:41,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:41,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:41,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740887334] [2019-10-22 11:25:41,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:41,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:41,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:41,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:41,446 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-10-22 11:25:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:42,007 INFO L93 Difference]: Finished difference Result 1449 states and 1931 transitions. [2019-10-22 11:25:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:42,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-22 11:25:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:42,010 INFO L225 Difference]: With dead ends: 1449 [2019-10-22 11:25:42,011 INFO L226 Difference]: Without dead ends: 792 [2019-10-22 11:25:42,012 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:42,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-10-22 11:25:42,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2019-10-22 11:25:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-22 11:25:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1025 transitions. [2019-10-22 11:25:42,029 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1025 transitions. Word has length 152 [2019-10-22 11:25:42,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:42,029 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1025 transitions. [2019-10-22 11:25:42,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1025 transitions. [2019-10-22 11:25:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 11:25:42,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:42,032 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:42,032 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:42,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1709270971, now seen corresponding path program 1 times [2019-10-22 11:25:42,033 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:42,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558354637] [2019-10-22 11:25:42,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:42,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:42,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-22 11:25:42,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558354637] [2019-10-22 11:25:42,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:42,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:42,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518609477] [2019-10-22 11:25:42,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:42,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:42,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:42,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:42,088 INFO L87 Difference]: Start difference. First operand 790 states and 1025 transitions. Second operand 3 states. [2019-10-22 11:25:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:42,486 INFO L93 Difference]: Finished difference Result 1709 states and 2245 transitions. [2019-10-22 11:25:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:42,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-22 11:25:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:42,490 INFO L225 Difference]: With dead ends: 1709 [2019-10-22 11:25:42,490 INFO L226 Difference]: Without dead ends: 1052 [2019-10-22 11:25:42,491 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-10-22 11:25:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-22 11:25:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-10-22 11:25:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-10-22 11:25:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1323 transitions. [2019-10-22 11:25:42,539 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1323 transitions. Word has length 156 [2019-10-22 11:25:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:42,540 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1323 transitions. [2019-10-22 11:25:42,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1323 transitions. [2019-10-22 11:25:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-22 11:25:42,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:42,543 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:42,543 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:42,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:42,543 INFO L82 PathProgramCache]: Analyzing trace with hash -467564647, now seen corresponding path program 1 times [2019-10-22 11:25:42,543 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:42,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291690332] [2019-10-22 11:25:42,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:42,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:42,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 11:25:42,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291690332] [2019-10-22 11:25:42,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:42,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:42,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149927616] [2019-10-22 11:25:42,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:42,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:42,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:42,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:42,605 INFO L87 Difference]: Start difference. First operand 1052 states and 1323 transitions. Second operand 4 states. [2019-10-22 11:25:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:43,227 INFO L93 Difference]: Finished difference Result 3281 states and 4154 transitions. [2019-10-22 11:25:43,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:43,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-10-22 11:25:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:43,239 INFO L225 Difference]: With dead ends: 3281 [2019-10-22 11:25:43,239 INFO L226 Difference]: Without dead ends: 2362 [2019-10-22 11:25:43,241 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-10-22 11:25:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-10-22 11:25:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 11:25:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2019-10-22 11:25:43,282 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 165 [2019-10-22 11:25:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:43,282 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2019-10-22 11:25:43,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2019-10-22 11:25:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-22 11:25:43,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:43,291 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:43,291 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:43,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:43,293 INFO L82 PathProgramCache]: Analyzing trace with hash 765811402, now seen corresponding path program 1 times [2019-10-22 11:25:43,293 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:43,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454207360] [2019-10-22 11:25:43,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:43,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:43,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 11:25:43,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454207360] [2019-10-22 11:25:43,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:43,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:43,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806800828] [2019-10-22 11:25:43,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:43,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:43,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:43,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:43,377 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand 5 states. [2019-10-22 11:25:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:44,201 INFO L93 Difference]: Finished difference Result 3805 states and 4667 transitions. [2019-10-22 11:25:44,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:44,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-10-22 11:25:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:44,208 INFO L225 Difference]: With dead ends: 3805 [2019-10-22 11:25:44,208 INFO L226 Difference]: Without dead ends: 2231 [2019-10-22 11:25:44,210 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-10-22 11:25:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-10-22 11:25:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2019-10-22 11:25:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-10-22 11:25:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2373 transitions. [2019-10-22 11:25:44,249 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2373 transitions. Word has length 171 [2019-10-22 11:25:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:44,250 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2373 transitions. [2019-10-22 11:25:44,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2373 transitions. [2019-10-22 11:25:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-22 11:25:44,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:44,254 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:44,254 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1768959985, now seen corresponding path program 1 times [2019-10-22 11:25:44,255 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:44,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327444740] [2019-10-22 11:25:44,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:44,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:44,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 11:25:44,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327444740] [2019-10-22 11:25:44,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:44,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:44,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210329907] [2019-10-22 11:25:44,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:44,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:44,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:44,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:44,313 INFO L87 Difference]: Start difference. First operand 1969 states and 2373 transitions. Second operand 3 states. [2019-10-22 11:25:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:44,702 INFO L93 Difference]: Finished difference Result 4067 states and 4887 transitions. [2019-10-22 11:25:44,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:44,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-22 11:25:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:44,708 INFO L225 Difference]: With dead ends: 4067 [2019-10-22 11:25:44,709 INFO L226 Difference]: Without dead ends: 1969 [2019-10-22 11:25:44,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-10-22 11:25:44,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-10-22 11:25:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-10-22 11:25:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2015 transitions. [2019-10-22 11:25:44,747 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2015 transitions. Word has length 174 [2019-10-22 11:25:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:44,748 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2015 transitions. [2019-10-22 11:25:44,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2015 transitions. [2019-10-22 11:25:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-22 11:25:44,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:44,752 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:44,752 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:44,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1455962891, now seen corresponding path program 1 times [2019-10-22 11:25:44,752 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:44,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492888077] [2019-10-22 11:25:44,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:44,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:44,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 11:25:44,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492888077] [2019-10-22 11:25:44,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:44,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:44,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551864296] [2019-10-22 11:25:44,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:44,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:44,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:44,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:44,844 INFO L87 Difference]: Start difference. First operand 1838 states and 2015 transitions. Second operand 3 states. [2019-10-22 11:25:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:45,193 INFO L93 Difference]: Finished difference Result 3674 states and 4028 transitions. [2019-10-22 11:25:45,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:45,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-22 11:25:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:45,200 INFO L225 Difference]: With dead ends: 3674 [2019-10-22 11:25:45,200 INFO L226 Difference]: Without dead ends: 1838 [2019-10-22 11:25:45,202 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-10-22 11:25:45,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-10-22 11:25:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-10-22 11:25:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-10-22 11:25:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2010 transitions. [2019-10-22 11:25:45,242 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2010 transitions. Word has length 189 [2019-10-22 11:25:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:45,245 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2010 transitions. [2019-10-22 11:25:45,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2010 transitions. [2019-10-22 11:25:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-22 11:25:45,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:45,250 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:45,251 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:45,251 INFO L82 PathProgramCache]: Analyzing trace with hash -380467305, now seen corresponding path program 1 times [2019-10-22 11:25:45,251 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:45,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313801834] [2019-10-22 11:25:45,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-22 11:25:45,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313801834] [2019-10-22 11:25:45,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683510518] [2019-10-22 11:25:45,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:45,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:25:45,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-22 11:25:45,634 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-22 11:25:45,692 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:25:45,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-22 11:25:45,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535513747] [2019-10-22 11:25:45,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:45,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:45,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:45,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:45,694 INFO L87 Difference]: Start difference. First operand 1838 states and 2010 transitions. Second operand 3 states. [2019-10-22 11:25:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:46,036 INFO L93 Difference]: Finished difference Result 3936 states and 4310 transitions. [2019-10-22 11:25:46,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:46,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-22 11:25:46,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:46,042 INFO L225 Difference]: With dead ends: 3936 [2019-10-22 11:25:46,042 INFO L226 Difference]: Without dead ends: 1969 [2019-10-22 11:25:46,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 434 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-10-22 11:25:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-10-22 11:25:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-10-22 11:25:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1977 transitions. [2019-10-22 11:25:46,079 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1977 transitions. Word has length 218 [2019-10-22 11:25:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:46,079 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1977 transitions. [2019-10-22 11:25:46,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1977 transitions. [2019-10-22 11:25:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-22 11:25:46,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:46,084 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:46,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:46,285 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:46,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:46,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1438607801, now seen corresponding path program 1 times [2019-10-22 11:25:46,285 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:46,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887279491] [2019-10-22 11:25:46,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 11:25:46,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887279491] [2019-10-22 11:25:46,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32618683] [2019-10-22 11:25:46,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:46,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:25:46,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-22 11:25:46,718 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-22 11:25:46,771 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:25:46,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-22 11:25:46,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829489720] [2019-10-22 11:25:46,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:46,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:46,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:46,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:46,773 INFO L87 Difference]: Start difference. First operand 1838 states and 1977 transitions. Second operand 3 states. [2019-10-22 11:25:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:47,130 INFO L93 Difference]: Finished difference Result 1838 states and 1977 transitions. [2019-10-22 11:25:47,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:47,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-10-22 11:25:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:47,131 INFO L225 Difference]: With dead ends: 1838 [2019-10-22 11:25:47,132 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:25:47,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 494 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:25:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:25:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:25:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:25:47,134 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2019-10-22 11:25:47,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:47,134 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:25:47,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:25:47,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:25:47,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:47,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:25:47,512 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-10-22 11:25:47,626 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-10-22 11:25:47,628 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 11:25:47,628 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 11:25:47,629 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 11:25:47,630 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,631 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,632 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,635 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 11:25:47,635 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 11:25:47,635 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 11:25:47,635 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 11:25:47,635 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 11:25:47,635 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 11:25:47,636 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 11:25:47,636 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 11:25:47,636 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 11:25:47,636 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse1 (<= ~a21~0 0)) (.cse3 (= ~a17~0 1)) (.cse2 (not (= ~a16~0 6))) (.cse4 (= ~a20~0 1)) (.cse5 (not (= ~a7~0 1))) (.cse7 (<= ~a17~0 0)) (.cse6 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4) (and .cse5 .cse3 .cse6) (and .cse7 .cse6 .cse4) (and .cse3 .cse6 .cse4) (and .cse2 .cse7 .cse6) (and .cse6 .cse4 (= ~a16~0 5)) (and .cse5 .cse7 .cse6))) [2019-10-22 11:25:47,636 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,636 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,636 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 11:25:47,637 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 11:25:47,638 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 11:25:47,639 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 11:25:47,640 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 11:25:47,640 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 11:25:47,642 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:25:47,642 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 11:25:47,643 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 11:25:47,643 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 11:25:47,643 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 11:25:47,643 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 11:25:47,643 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 11:25:47,644 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,644 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse1 (<= ~a21~0 0)) (.cse3 (= ~a17~0 1)) (.cse2 (not (= ~a16~0 6))) (.cse4 (= ~a20~0 1)) (.cse5 (not (= ~a7~0 1))) (.cse7 (<= ~a17~0 0)) (.cse6 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4) (and .cse5 .cse3 .cse6) (and .cse7 .cse6 .cse4) (and .cse3 .cse6 .cse4) (and .cse2 .cse7 .cse6) (and .cse6 .cse4 (= ~a16~0 5)) (and .cse5 .cse7 .cse6))) [2019-10-22 11:25:47,644 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,644 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,644 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,644 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,644 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 11:25:47,645 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,646 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 11:25:47,647 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 11:25:47,648 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 11:25:47,648 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,650 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,650 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,650 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,650 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,650 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 11:25:47,650 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,650 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 11:25:47,650 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 551) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 11:25:47,651 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 11:25:47,652 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 11:25:47,653 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 11:25:47,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:47 BoogieIcfgContainer [2019-10-22 11:25:47,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:47,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:47,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:47,678 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:47,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:38" (3/4) ... [2019-10-22 11:25:47,691 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:25:47,720 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:25:47,721 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:25:47,843 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_38ec0347-365d-456f-bafb-55d7e3d6e903/bin/utaipan/witness.graphml [2019-10-22 11:25:47,843 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:47,845 INFO L168 Benchmark]: Toolchain (without parser) took 11221.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.5 MB). Free memory was 945.8 MB in the beginning and 968.4 MB in the end (delta: -22.6 MB). Peak memory consumption was 397.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:47,845 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:47,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:47,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:47,846 INFO L168 Benchmark]: Boogie Preprocessor took 43.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:47,846 INFO L168 Benchmark]: RCFGBuilder took 1277.20 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: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:47,847 INFO L168 Benchmark]: TraceAbstraction took 8980.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 274.2 MB). Free memory was 1.0 GB in the beginning and 993.3 MB in the end (delta: 7.0 MB). Peak memory consumption was 281.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:47,847 INFO L168 Benchmark]: Witness Printer took 165.46 ms. Allocated memory is still 1.4 GB. Free memory was 993.3 MB in the beginning and 968.4 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:47,849 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 686.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1277.20 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: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8980.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 274.2 MB). Free memory was 1.0 GB in the beginning and 993.3 MB in the end (delta: 7.0 MB). Peak memory consumption was 281.2 MB. Max. memory is 11.5 GB. * Witness Printer took 165.46 ms. Allocated memory is still 1.4 GB. Free memory was 993.3 MB in the beginning and 968.4 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 551]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || ((!(a7 == 1) && a17 <= 0) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || ((!(a7 == 1) && a17 <= 0) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 8.8s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 860 SDtfs, 1681 SDslu, 76 SDs, 0 SdLazy, 4427 SolverSat, 713 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 969 GetRequests, 940 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1312 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 37 NumberOfFragments, 177 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1577 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 174 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2339 NumberOfCodeBlocks, 2339 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2789 ConstructedInterpolants, 0 QuantifiedInterpolants, 1251203 SizeOfPredicates, 2 NumberOfNonLiveVariables, 815 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 1674/1771 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...