./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label59.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_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label59.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/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 c830b0c5c33990192c3ba87f57f72df9f3b5a041 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:21:03,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:03,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:03,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:03,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:03,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:03,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:03,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:03,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:03,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:03,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:03,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:03,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:03,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:03,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:03,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:03,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:03,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:03,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:03,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:03,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:03,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:03,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:03,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:03,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:03,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:03,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:03,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:03,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:03,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:03,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:03,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:03,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:03,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:03,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:03,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:03,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:03,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:03,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:03,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:03,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:03,752 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:03,763 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:03,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:03,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:03,764 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:03,764 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:03,764 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:03,764 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:03,764 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:03,764 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:03,765 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:03,765 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:03,765 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:03,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:03,766 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:03,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:03,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:03,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:03,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:03,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:03,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:03,767 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:03,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:03,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:03,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:03,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:03,768 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:03,768 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:03,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:03,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:03,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:03,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:03,769 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:03,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:03,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:03,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:03,770 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_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/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 -> c830b0c5c33990192c3ba87f57f72df9f3b5a041 [2019-10-22 11:21:03,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:03,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:03,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:03,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:03,815 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:03,815 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label59.c [2019-10-22 11:21:03,866 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/bin/utaipan/data/1c0af2e33/ea7e9f2b3cc847f79f8fd93bbae7b856/FLAG568f696b1 [2019-10-22 11:21:04,319 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:04,320 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/sv-benchmarks/c/eca-rers2012/Problem01_label59.c [2019-10-22 11:21:04,330 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/bin/utaipan/data/1c0af2e33/ea7e9f2b3cc847f79f8fd93bbae7b856/FLAG568f696b1 [2019-10-22 11:21:04,647 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/bin/utaipan/data/1c0af2e33/ea7e9f2b3cc847f79f8fd93bbae7b856 [2019-10-22 11:21:04,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:04,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:04,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:04,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:04,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:04,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:04" (1/1) ... [2019-10-22 11:21:04,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c5c8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:04, skipping insertion in model container [2019-10-22 11:21:04,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:04" (1/1) ... [2019-10-22 11:21:04,664 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:04,721 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:05,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:05,127 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:05,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:05,238 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:05,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:05 WrapperNode [2019-10-22 11:21:05,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:05,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:05,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:05,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:05,247 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:21:05" (1/1) ... [2019-10-22 11:21:05,259 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:21:05" (1/1) ... [2019-10-22 11:21:05,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:05,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:05,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:05,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:05,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:05" (1/1) ... [2019-10-22 11:21:05,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:05" (1/1) ... [2019-10-22 11:21:05,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:05" (1/1) ... [2019-10-22 11:21:05,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:05" (1/1) ... [2019-10-22 11:21:05,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:05" (1/1) ... [2019-10-22 11:21:05,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:05" (1/1) ... [2019-10-22 11:21:05,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:05" (1/1) ... [2019-10-22 11:21:05,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:05,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:05,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:05,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:05,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/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:21:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:05,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:06,284 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:06,284 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:21:06,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:06 BoogieIcfgContainer [2019-10-22 11:21:06,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:06,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:06,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:06,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:06,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:04" (1/3) ... [2019-10-22 11:21:06,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad35165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:06, skipping insertion in model container [2019-10-22 11:21:06,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:05" (2/3) ... [2019-10-22 11:21:06,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad35165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:06, skipping insertion in model container [2019-10-22 11:21:06,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:06" (3/3) ... [2019-10-22 11:21:06,292 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label59.c [2019-10-22 11:21:06,300 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:06,309 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:21:06,319 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:21:06,341 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:06,342 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:06,342 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:06,342 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:06,342 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:06,342 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:06,342 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:06,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 11:21:06,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-22 11:21:06,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:06,375 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] [2019-10-22 11:21:06,376 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:06,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:06,382 INFO L82 PathProgramCache]: Analyzing trace with hash 806224438, now seen corresponding path program 1 times [2019-10-22 11:21:06,389 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:06,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587226170] [2019-10-22 11:21:06,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:06,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:06,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:06,764 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:21:06,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587226170] [2019-10-22 11:21:06,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:06,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:06,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418514857] [2019-10-22 11:21:06,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:06,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:06,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:06,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:06,793 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-10-22 11:21:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:07,923 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-10-22 11:21:07,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:07,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-22 11:21:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:07,939 INFO L225 Difference]: With dead ends: 662 [2019-10-22 11:21:07,939 INFO L226 Difference]: Without dead ends: 397 [2019-10-22 11:21:07,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-22 11:21:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-10-22 11:21:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-22 11:21:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-10-22 11:21:08,006 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 89 [2019-10-22 11:21:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:08,006 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-10-22 11:21:08,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-10-22 11:21:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-22 11:21:08,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:08,010 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:08,010 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:08,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:08,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1182931709, now seen corresponding path program 1 times [2019-10-22 11:21:08,011 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:08,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443551176] [2019-10-22 11:21:08,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:08,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443551176] [2019-10-22 11:21:08,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:08,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:08,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746655959] [2019-10-22 11:21:08,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:08,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:08,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:08,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:08,143 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 3 states. [2019-10-22 11:21:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:08,567 INFO L93 Difference]: Finished difference Result 1185 states and 1654 transitions. [2019-10-22 11:21:08,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:08,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-22 11:21:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:08,571 INFO L225 Difference]: With dead ends: 1185 [2019-10-22 11:21:08,571 INFO L226 Difference]: Without dead ends: 790 [2019-10-22 11:21:08,573 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:21:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-22 11:21:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-10-22 11:21:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-22 11:21:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-10-22 11:21:08,609 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 96 [2019-10-22 11:21:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:08,610 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-10-22 11:21:08,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-10-22 11:21:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 11:21:08,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:08,616 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:08,616 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2032630224, now seen corresponding path program 1 times [2019-10-22 11:21:08,617 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:08,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140580871] [2019-10-22 11:21:08,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:21:08,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140580871] [2019-10-22 11:21:08,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:08,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:08,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121564396] [2019-10-22 11:21:08,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:08,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:08,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:08,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:08,666 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-10-22 11:21:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:09,103 INFO L93 Difference]: Finished difference Result 1971 states and 2548 transitions. [2019-10-22 11:21:09,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:09,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 11:21:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:09,107 INFO L225 Difference]: With dead ends: 1971 [2019-10-22 11:21:09,107 INFO L226 Difference]: Without dead ends: 1183 [2019-10-22 11:21:09,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:09,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-10-22 11:21:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2019-10-22 11:21:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-10-22 11:21:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1485 transitions. [2019-10-22 11:21:09,134 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1485 transitions. Word has length 102 [2019-10-22 11:21:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:09,134 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1485 transitions. [2019-10-22 11:21:09,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1485 transitions. [2019-10-22 11:21:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 11:21:09,137 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:09,137 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:09,137 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1446444757, now seen corresponding path program 1 times [2019-10-22 11:21:09,138 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:09,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746983605] [2019-10-22 11:21:09,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:09,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:09,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:21:09,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746983605] [2019-10-22 11:21:09,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:09,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:09,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987924155] [2019-10-22 11:21:09,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:09,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:09,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:09,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:09,196 INFO L87 Difference]: Start difference. First operand 1183 states and 1485 transitions. Second operand 3 states. [2019-10-22 11:21:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:09,631 INFO L93 Difference]: Finished difference Result 3019 states and 3821 transitions. [2019-10-22 11:21:09,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:09,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 11:21:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:09,637 INFO L225 Difference]: With dead ends: 3019 [2019-10-22 11:21:09,637 INFO L226 Difference]: Without dead ends: 1707 [2019-10-22 11:21:09,641 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:21:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-10-22 11:21:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-10-22 11:21:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-10-22 11:21:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1661 transitions. [2019-10-22 11:21:09,683 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1661 transitions. Word has length 104 [2019-10-22 11:21:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:09,685 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1661 transitions. [2019-10-22 11:21:09,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1661 transitions. [2019-10-22 11:21:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-22 11:21:09,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:09,688 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:21:09,688 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1854334615, now seen corresponding path program 1 times [2019-10-22 11:21:09,689 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:09,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702453894] [2019-10-22 11:21:09,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:09,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:09,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:21:09,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702453894] [2019-10-22 11:21:09,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:09,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:09,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026985283] [2019-10-22 11:21:09,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:09,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:09,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:09,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:09,791 INFO L87 Difference]: Start difference. First operand 1445 states and 1661 transitions. Second operand 4 states. [2019-10-22 11:21:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:10,281 INFO L93 Difference]: Finished difference Result 3024 states and 3467 transitions. [2019-10-22 11:21:10,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:10,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-22 11:21:10,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:10,286 INFO L225 Difference]: With dead ends: 3024 [2019-10-22 11:21:10,287 INFO L226 Difference]: Without dead ends: 1581 [2019-10-22 11:21:10,288 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:21:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2019-10-22 11:21:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1576. [2019-10-22 11:21:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-10-22 11:21:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1795 transitions. [2019-10-22 11:21:10,324 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1795 transitions. Word has length 112 [2019-10-22 11:21:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:10,324 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1795 transitions. [2019-10-22 11:21:10,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1795 transitions. [2019-10-22 11:21:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-22 11:21:10,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:10,326 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:10,327 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1664786527, now seen corresponding path program 1 times [2019-10-22 11:21:10,327 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:10,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062819601] [2019-10-22 11:21:10,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:10,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:10,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:10,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062819601] [2019-10-22 11:21:10,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:10,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:10,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502453953] [2019-10-22 11:21:10,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:10,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:10,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:10,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:10,383 INFO L87 Difference]: Start difference. First operand 1576 states and 1795 transitions. Second operand 4 states. [2019-10-22 11:21:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:10,909 INFO L93 Difference]: Finished difference Result 3805 states and 4379 transitions. [2019-10-22 11:21:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:10,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-22 11:21:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:10,915 INFO L225 Difference]: With dead ends: 3805 [2019-10-22 11:21:10,915 INFO L226 Difference]: Without dead ends: 2362 [2019-10-22 11:21:10,917 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:21:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-10-22 11:21:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-10-22 11:21:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 11:21:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions. [2019-10-22 11:21:10,951 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 116 [2019-10-22 11:21:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:10,951 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions. [2019-10-22 11:21:10,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions. [2019-10-22 11:21:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-22 11:21:10,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:10,953 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:10,954 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:10,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:10,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2107396270, now seen corresponding path program 1 times [2019-10-22 11:21:10,954 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:10,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497319234] [2019-10-22 11:21:10,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:10,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:10,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:11,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497319234] [2019-10-22 11:21:11,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:11,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:21:11,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186554590] [2019-10-22 11:21:11,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:21:11,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:11,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:21:11,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:11,113 INFO L87 Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand 8 states. [2019-10-22 11:21:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:11,846 INFO L93 Difference]: Finished difference Result 3716 states and 4094 transitions. [2019-10-22 11:21:11,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:21:11,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-22 11:21:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:11,854 INFO L225 Difference]: With dead ends: 3716 [2019-10-22 11:21:11,854 INFO L226 Difference]: Without dead ends: 2142 [2019-10-22 11:21:11,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-10-22 11:21:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1838. [2019-10-22 11:21:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-10-22 11:21:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2009 transitions. [2019-10-22 11:21:11,898 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2009 transitions. Word has length 122 [2019-10-22 11:21:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:11,899 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2009 transitions. [2019-10-22 11:21:11,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:21:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2009 transitions. [2019-10-22 11:21:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-22 11:21:11,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:11,902 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:11,903 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:11,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:11,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1246749755, now seen corresponding path program 1 times [2019-10-22 11:21:11,903 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:11,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991838489] [2019-10-22 11:21:11,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:11,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:11,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:12,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991838489] [2019-10-22 11:21:12,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:12,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:12,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731554007] [2019-10-22 11:21:12,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:12,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:12,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:12,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:12,064 INFO L87 Difference]: Start difference. First operand 1838 states and 2009 transitions. Second operand 4 states. [2019-10-22 11:21:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:12,473 INFO L93 Difference]: Finished difference Result 3805 states and 4174 transitions. [2019-10-22 11:21:12,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:12,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-22 11:21:12,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:12,479 INFO L225 Difference]: With dead ends: 3805 [2019-10-22 11:21:12,479 INFO L226 Difference]: Without dead ends: 2100 [2019-10-22 11:21:12,481 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:21:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-10-22 11:21:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2019-10-22 11:21:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-10-22 11:21:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2260 transitions. [2019-10-22 11:21:12,514 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2260 transitions. Word has length 148 [2019-10-22 11:21:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:12,515 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2260 transitions. [2019-10-22 11:21:12,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2260 transitions. [2019-10-22 11:21:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-22 11:21:12,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:12,518 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:12,518 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:12,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:12,519 INFO L82 PathProgramCache]: Analyzing trace with hash 691080292, now seen corresponding path program 1 times [2019-10-22 11:21:12,519 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:12,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669323919] [2019-10-22 11:21:12,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:12,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:12,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:12,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669323919] [2019-10-22 11:21:12,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:12,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-22 11:21:12,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56254944] [2019-10-22 11:21:12,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 11:21:12,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:12,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 11:21:12,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:21:12,964 INFO L87 Difference]: Start difference. First operand 2100 states and 2260 transitions. Second operand 13 states. [2019-10-22 11:21:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:13,925 INFO L93 Difference]: Finished difference Result 4515 states and 4867 transitions. [2019-10-22 11:21:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:21:13,926 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2019-10-22 11:21:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:13,930 INFO L225 Difference]: With dead ends: 4515 [2019-10-22 11:21:13,930 INFO L226 Difference]: Without dead ends: 2400 [2019-10-22 11:21:13,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:21:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2019-10-22 11:21:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2135. [2019-10-22 11:21:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-10-22 11:21:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2292 transitions. [2019-10-22 11:21:13,965 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2292 transitions. Word has length 161 [2019-10-22 11:21:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:13,966 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 2292 transitions. [2019-10-22 11:21:13,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 11:21:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2292 transitions. [2019-10-22 11:21:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-22 11:21:13,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:13,971 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:13,971 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:13,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2108776820, now seen corresponding path program 1 times [2019-10-22 11:21:13,971 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:13,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194711539] [2019-10-22 11:21:13,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:13,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:13,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:14,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194711539] [2019-10-22 11:21:14,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:14,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:14,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317188450] [2019-10-22 11:21:14,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:14,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:14,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:14,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:14,078 INFO L87 Difference]: Start difference. First operand 2135 states and 2292 transitions. Second operand 6 states. [2019-10-22 11:21:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:14,652 INFO L93 Difference]: Finished difference Result 4152 states and 4463 transitions. [2019-10-22 11:21:14,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:14,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-10-22 11:21:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:14,660 INFO L225 Difference]: With dead ends: 4152 [2019-10-22 11:21:14,660 INFO L226 Difference]: Without dead ends: 2150 [2019-10-22 11:21:14,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2019-10-22 11:21:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2135. [2019-10-22 11:21:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-10-22 11:21:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2269 transitions. [2019-10-22 11:21:14,695 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2269 transitions. Word has length 163 [2019-10-22 11:21:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:14,695 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 2269 transitions. [2019-10-22 11:21:14,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2269 transitions. [2019-10-22 11:21:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-22 11:21:14,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:14,699 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:21:14,699 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:14,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:14,699 INFO L82 PathProgramCache]: Analyzing trace with hash -263540360, now seen corresponding path program 1 times [2019-10-22 11:21:14,699 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:14,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518088415] [2019-10-22 11:21:14,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:14,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:14,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-22 11:21:14,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518088415] [2019-10-22 11:21:14,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:14,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:14,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430145883] [2019-10-22 11:21:14,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:14,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:14,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:14,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:14,838 INFO L87 Difference]: Start difference. First operand 2135 states and 2269 transitions. Second operand 4 states. [2019-10-22 11:21:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:15,321 INFO L93 Difference]: Finished difference Result 4921 states and 5237 transitions. [2019-10-22 11:21:15,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:15,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-10-22 11:21:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:15,321 INFO L225 Difference]: With dead ends: 4921 [2019-10-22 11:21:15,321 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:21:15,324 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:21:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:21:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:21:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:21:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:21:15,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2019-10-22 11:21:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:15,325 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:21:15,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:21:15,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:21:15,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:21:15,841 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-10-22 11:21:16,210 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-10-22 11:21:16,212 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 11:21:16,212 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 11:21:16,212 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,212 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,212 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,212 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,212 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,212 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,212 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 11:21:16,212 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,213 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,214 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 11:21:16,214 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 11:21:16,214 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 11:21:16,214 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 11:21:16,214 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 11:21:16,214 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 11:21:16,215 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 11:21:16,215 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 11:21:16,215 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 11:21:16,215 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 11:21:16,215 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 11:21:16,215 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 11:21:16,215 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 11:21:16,215 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 11:21:16,215 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 11:21:16,215 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,215 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 11:21:16,216 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 11:21:16,217 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= 15 ~a8~0)) (.cse4 (= ~a20~0 1))) (let ((.cse6 (not .cse4)) (.cse9 (= 5 ~a16~0)) (.cse5 (= 1 ~a7~0)) (.cse0 (= ~a8~0 13)) (.cse1 (= ~a12~0 8)) (.cse2 (= ~a17~0 1)) (.cse3 (= ~a21~0 1)) (.cse8 (= ~a16~0 4)) (.cse10 (not .cse7)) (.cse11 (<= ~a17~0 0))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4)) (and .cse5 .cse2 .cse3) (and .cse6 .cse2 .cse1 .cse3 .cse7 (not .cse8)) (and .cse5 .cse7 .cse9) (or (and .cse6 .cse2 .cse1 .cse3 .cse7 (or (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input))) (and (= 2 ULTIMATE.start_calculate_output_~input) .cse6 .cse2 .cse1 .cse3 .cse7)) (and (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse2 .cse1 .cse3 .cse7 (= ~a16~0 5)) (and .cse5 .cse10 .cse11) (and .cse11 .cse9) (and .cse1 .cse11 .cse3 .cse7) (and .cse5 .cse0) (and .cse8 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse10 .cse11)))) [2019-10-22 11:21:16,217 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,217 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,217 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,217 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,217 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,217 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 11:21:16,218 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 11:21:16,218 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 11:21:16,218 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 11:21:16,218 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 11:21:16,218 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 11:21:16,218 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 11:21:16,218 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 11:21:16,222 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 11:21:16,222 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 11:21:16,222 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 11:21:16,222 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 11:21:16,222 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 11:21:16,222 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 11:21:16,222 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,222 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,222 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 443) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 11:21:16,223 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 11:21:16,224 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 11:21:16,225 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 11:21:16,225 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 11:21:16,225 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 11:21:16,225 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 11:21:16,225 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,225 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse7 (= 15 ~a8~0)) (.cse4 (= ~a20~0 1))) (let ((.cse6 (not .cse4)) (.cse9 (= 5 ~a16~0)) (.cse5 (= 1 ~a7~0)) (.cse0 (= ~a8~0 13)) (.cse1 (= ~a12~0 8)) (.cse2 (= ~a17~0 1)) (.cse3 (= ~a21~0 1)) (.cse8 (= ~a16~0 4)) (.cse10 (not .cse7)) (.cse11 (<= ~a17~0 0))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4)) (and .cse5 .cse2 .cse3) (and .cse6 .cse2 .cse1 .cse3 .cse7 (not .cse8)) (and .cse5 .cse7 .cse9) (or (and .cse6 .cse2 .cse1 .cse3 .cse7 (or (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input))) (and (= 2 ULTIMATE.start_calculate_output_~input) .cse6 .cse2 .cse1 .cse3 .cse7)) (and .cse5 .cse10 .cse11) (and .cse11 .cse9) (and .cse2 .cse1 .cse3 .cse7 (= ~a16~0 5)) (and .cse1 .cse11 .cse3 .cse7) (and .cse5 .cse0) (and .cse8 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse10 .cse11)))) [2019-10-22 11:21:16,225 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,225 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,225 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,225 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,225 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 11:21:16,226 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 11:21:16,226 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 11:21:16,226 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 11:21:16,226 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 11:21:16,226 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 11:21:16,226 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 11:21:16,226 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 11:21:16,228 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,228 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,228 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,228 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,228 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,228 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 11:21:16,228 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,229 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 11:21:16,230 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 11:21:16,231 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 11:21:16,232 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 11:21:16,233 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 11:21:16,233 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 11:21:16,233 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 11:21:16,233 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 11:21:16,233 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 11:21:16,233 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 11:21:16,233 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 11:21:16,233 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 11:21:16,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:16 BoogieIcfgContainer [2019-10-22 11:21:16,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:16,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:16,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:16,257 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:16,258 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:06" (3/4) ... [2019-10-22 11:21:16,271 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:21:16,286 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:21:16,291 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:21:16,422 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a9f0ed2e-a9e9-41d2-9928-8e3093182dd4/bin/utaipan/witness.graphml [2019-10-22 11:21:16,422 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:16,423 INFO L168 Benchmark]: Toolchain (without parser) took 11773.04 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.7 MB). Free memory was 945.8 MB in the beginning and 1.3 GB in the end (delta: -396.9 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:16,424 INFO L168 Benchmark]: CDTParser took 0.15 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:21:16,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:16,424 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:16,424 INFO L168 Benchmark]: Boogie Preprocessor took 67.21 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.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:16,425 INFO L168 Benchmark]: RCFGBuilder took 921.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 113.8 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:16,425 INFO L168 Benchmark]: TraceAbstraction took 9970.56 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.8 MB). Free memory was 998.5 MB in the beginning and 1.4 GB in the end (delta: -360.6 MB). Peak memory consumption was 486.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:16,425 INFO L168 Benchmark]: Witness Printer took 164.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:16,430 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.15 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 588.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.21 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.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 921.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 113.8 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9970.56 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.8 MB). Free memory was 998.5 MB in the beginning and 1.4 GB in the end (delta: -360.6 MB). Peak memory consumption was 486.8 MB. Max. memory is 11.5 GB. * Witness Printer took 164.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 443]: 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: ((((((((((((a8 == 13 && a12 == 8) && (a17 == 1 && a21 == 1) && a20 == 1) || ((1 == a7 && a17 == 1) && a21 == 1)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || ((1 == a7 && 15 == a8) && 5 == a16)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && ((3 == input || 6 == input) || 5 == input)) || (((((2 == input && !(a20 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || (((((!(1 == input) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || ((1 == a7 && !(15 == a8)) && a17 <= 0)) || (a17 <= 0 && 5 == a16)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && 15 == a8)) || (1 == a7 && a8 == 13)) || (((((a16 == 4 && !(15 == a8)) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((a16 == 4 && !(15 == a8)) && a17 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((a8 == 13 && a12 == 8) && (a17 == 1 && a21 == 1) && a20 == 1) || ((1 == a7 && a17 == 1) && a21 == 1)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || ((1 == a7 && 15 == a8) && 5 == a16)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && ((3 == input || 6 == input) || 5 == input)) || (((((2 == input && !(a20 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || ((1 == a7 && !(15 == a8)) && a17 <= 0)) || (a17 <= 0 && 5 == a16)) || ((((a17 == 1 && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && 15 == a8)) || (1 == a7 && a8 == 13)) || (((((a16 == 4 && !(15 == a8)) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((a16 == 4 && !(15 == a8)) && a17 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.8s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 845 SDtfs, 3285 SDslu, 143 SDs, 0 SdLazy, 6607 SolverSat, 895 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2135occurred in iteration=9, 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, 1637 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 58 NumberOfFragments, 389 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5657 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 693 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1425 NumberOfCodeBlocks, 1425 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1414 ConstructedInterpolants, 0 QuantifiedInterpolants, 931189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 627/627 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...