./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label57.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/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 17a767ebf51f6a233211ab82288cb9185242fdcf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:10:20,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:10:20,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:10:20,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:10:20,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:10:20,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:10:20,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:10:20,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:10:20,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:10:20,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:10:20,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:10:20,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:10:20,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:10:20,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:10:20,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:10:20,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:10:20,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:10:20,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:10:20,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:10:20,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:10:20,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:10:20,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:10:20,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:10:20,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:10:20,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:10:20,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:10:20,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:10:20,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:10:20,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:10:20,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:10:20,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:10:20,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:10:20,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:10:20,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:10:20,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:10:20,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:10:20,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:10:20,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:10:20,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:10:20,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:10:20,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:10:20,574 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 15:10:20,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:10:20,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:10:20,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:10:20,584 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:10:20,585 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:10:20,585 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:10:20,585 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 15:10:20,585 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:10:20,585 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:10:20,585 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 15:10:20,585 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 15:10:20,585 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:10:20,586 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 15:10:20,586 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 15:10:20,586 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 15:10:20,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:10:20,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:10:20,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:10:20,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:10:20,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:10:20,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:10:20,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:10:20,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:10:20,587 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:10:20,587 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:10:20,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:10:20,588 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:10:20,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:10:20,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:10:20,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:10:20,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:10:20,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:10:20,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:10:20,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:10:20,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:10:20,589 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 15:10:20,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:10:20,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:10:20,589 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:10:20,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:10:20,590 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/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/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 -> 17a767ebf51f6a233211ab82288cb9185242fdcf [2019-12-07 15:10:20,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:10:20,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:10:20,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:10:20,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:10:20,704 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:10:20,704 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem03_label57.c [2019-12-07 15:10:20,741 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/data/559c985d6/246f65c969fd4794910c4559f5c7fa69/FLAG0492a6891 [2019-12-07 15:10:21,275 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:10:21,275 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/sv-benchmarks/c/eca-rers2012/Problem03_label57.c [2019-12-07 15:10:21,287 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/data/559c985d6/246f65c969fd4794910c4559f5c7fa69/FLAG0492a6891 [2019-12-07 15:10:21,773 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/data/559c985d6/246f65c969fd4794910c4559f5c7fa69 [2019-12-07 15:10:21,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:10:21,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:10:21,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:10:21,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:10:21,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:10:21,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:10:21" (1/1) ... [2019-12-07 15:10:21,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bdc395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:21, skipping insertion in model container [2019-12-07 15:10:21,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:10:21" (1/1) ... [2019-12-07 15:10:21,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:10:21,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:10:22,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:10:22,223 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:10:22,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:10:22,384 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:10:22,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22 WrapperNode [2019-12-07 15:10:22,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:10:22,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:10:22,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:10:22,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:10:22,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22" (1/1) ... [2019-12-07 15:10:22,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22" (1/1) ... [2019-12-07 15:10:22,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:10:22,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:10:22,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:10:22,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:10:22,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22" (1/1) ... [2019-12-07 15:10:22,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22" (1/1) ... [2019-12-07 15:10:22,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22" (1/1) ... [2019-12-07 15:10:22,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22" (1/1) ... [2019-12-07 15:10:22,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22" (1/1) ... [2019-12-07 15:10:22,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22" (1/1) ... [2019-12-07 15:10:22,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22" (1/1) ... [2019-12-07 15:10:22,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:10:22,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:10:22,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:10:22,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:10:22,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/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-12-07 15:10:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:10:22,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:10:24,394 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:10:24,394 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 15:10:24,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:10:24 BoogieIcfgContainer [2019-12-07 15:10:24,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:10:24,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:10:24,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:10:24,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:10:24,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:10:21" (1/3) ... [2019-12-07 15:10:24,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fa57c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:10:24, skipping insertion in model container [2019-12-07 15:10:24,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:10:22" (2/3) ... [2019-12-07 15:10:24,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fa57c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:10:24, skipping insertion in model container [2019-12-07 15:10:24,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:10:24" (3/3) ... [2019-12-07 15:10:24,402 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label57.c [2019-12-07 15:10:24,411 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:10:24,417 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:10:24,424 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:10:24,444 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:10:24,445 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:10:24,445 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:10:24,445 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:10:24,445 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:10:24,445 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:10:24,445 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:10:24,445 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:10:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 15:10:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 15:10:24,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:24,486 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:24,486 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:24,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:24,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1467460075, now seen corresponding path program 1 times [2019-12-07 15:10:24,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:24,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202293303] [2019-12-07 15:10:24,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:24,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202293303] [2019-12-07 15:10:24,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:24,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:10:24,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971184975] [2019-12-07 15:10:24,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:10:24,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:24,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:10:24,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:24,822 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-12-07 15:10:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:25,455 INFO L93 Difference]: Finished difference Result 440 states and 860 transitions. [2019-12-07 15:10:25,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:10:25,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-12-07 15:10:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:25,467 INFO L225 Difference]: With dead ends: 440 [2019-12-07 15:10:25,467 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 15:10:25,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:25,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 15:10:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-12-07 15:10:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-12-07 15:10:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 549 transitions. [2019-12-07 15:10:25,511 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 549 transitions. Word has length 143 [2019-12-07 15:10:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:25,511 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 549 transitions. [2019-12-07 15:10:25,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:10:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 549 transitions. [2019-12-07 15:10:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 15:10:25,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:25,514 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:25,514 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash 732709047, now seen corresponding path program 1 times [2019-12-07 15:10:25,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:25,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559805317] [2019-12-07 15:10:25,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:25,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559805317] [2019-12-07 15:10:25,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:25,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:10:25,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775007092] [2019-12-07 15:10:25,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:10:25,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:10:25,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:25,585 INFO L87 Difference]: Start difference. First operand 289 states and 549 transitions. Second operand 4 states. [2019-12-07 15:10:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:26,467 INFO L93 Difference]: Finished difference Result 1149 states and 2191 transitions. [2019-12-07 15:10:26,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:10:26,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 15:10:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:26,472 INFO L225 Difference]: With dead ends: 1149 [2019-12-07 15:10:26,472 INFO L226 Difference]: Without dead ends: 861 [2019-12-07 15:10:26,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-07 15:10:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 575. [2019-12-07 15:10:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-07 15:10:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1014 transitions. [2019-12-07 15:10:26,494 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1014 transitions. Word has length 148 [2019-12-07 15:10:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:26,494 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1014 transitions. [2019-12-07 15:10:26,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:10:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1014 transitions. [2019-12-07 15:10:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 15:10:26,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:26,498 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:26,498 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:26,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:26,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1458028323, now seen corresponding path program 1 times [2019-12-07 15:10:26,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:26,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527598892] [2019-12-07 15:10:26,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:26,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527598892] [2019-12-07 15:10:26,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:26,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:10:26,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073471388] [2019-12-07 15:10:26,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:10:26,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:26,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:10:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:26,551 INFO L87 Difference]: Start difference. First operand 575 states and 1014 transitions. Second operand 3 states. [2019-12-07 15:10:26,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:26,842 INFO L93 Difference]: Finished difference Result 1149 states and 2027 transitions. [2019-12-07 15:10:26,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:10:26,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-12-07 15:10:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:26,845 INFO L225 Difference]: With dead ends: 1149 [2019-12-07 15:10:26,845 INFO L226 Difference]: Without dead ends: 575 [2019-12-07 15:10:26,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-12-07 15:10:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-12-07 15:10:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-07 15:10:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 964 transitions. [2019-12-07 15:10:26,857 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 964 transitions. Word has length 156 [2019-12-07 15:10:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:26,857 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 964 transitions. [2019-12-07 15:10:26,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:10:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 964 transitions. [2019-12-07 15:10:26,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 15:10:26,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:26,859 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:26,859 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:26,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:26,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1273580065, now seen corresponding path program 1 times [2019-12-07 15:10:26,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:26,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409642670] [2019-12-07 15:10:26,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 15:10:26,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409642670] [2019-12-07 15:10:26,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:26,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:10:26,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556645883] [2019-12-07 15:10:26,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:10:26,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:26,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:10:26,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:26,905 INFO L87 Difference]: Start difference. First operand 575 states and 964 transitions. Second operand 4 states. [2019-12-07 15:10:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:27,775 INFO L93 Difference]: Finished difference Result 2295 states and 3852 transitions. [2019-12-07 15:10:27,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:10:27,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 15:10:27,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:27,782 INFO L225 Difference]: With dead ends: 2295 [2019-12-07 15:10:27,782 INFO L226 Difference]: Without dead ends: 1721 [2019-12-07 15:10:27,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-12-07 15:10:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1147. [2019-12-07 15:10:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-12-07 15:10:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1820 transitions. [2019-12-07 15:10:27,806 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1820 transitions. Word has length 157 [2019-12-07 15:10:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:27,806 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1820 transitions. [2019-12-07 15:10:27,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:10:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1820 transitions. [2019-12-07 15:10:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 15:10:27,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:27,809 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:27,809 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:27,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:27,809 INFO L82 PathProgramCache]: Analyzing trace with hash 210122744, now seen corresponding path program 1 times [2019-12-07 15:10:27,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:27,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119345314] [2019-12-07 15:10:27,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 15:10:27,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119345314] [2019-12-07 15:10:27,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:27,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:10:27,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785132855] [2019-12-07 15:10:27,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:10:27,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:27,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:10:27,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:27,855 INFO L87 Difference]: Start difference. First operand 1147 states and 1820 transitions. Second operand 3 states. [2019-12-07 15:10:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:28,445 INFO L93 Difference]: Finished difference Result 2865 states and 4524 transitions. [2019-12-07 15:10:28,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:10:28,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-12-07 15:10:28,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:28,454 INFO L225 Difference]: With dead ends: 2865 [2019-12-07 15:10:28,455 INFO L226 Difference]: Without dead ends: 1719 [2019-12-07 15:10:28,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-12-07 15:10:28,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-12-07 15:10:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-12-07 15:10:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2681 transitions. [2019-12-07 15:10:28,492 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2681 transitions. Word has length 160 [2019-12-07 15:10:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:28,492 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2681 transitions. [2019-12-07 15:10:28,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:10:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2681 transitions. [2019-12-07 15:10:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 15:10:28,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:28,495 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:28,495 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:28,495 INFO L82 PathProgramCache]: Analyzing trace with hash 559027803, now seen corresponding path program 1 times [2019-12-07 15:10:28,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:28,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746250976] [2019-12-07 15:10:28,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 15:10:28,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746250976] [2019-12-07 15:10:28,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:28,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:10:28,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142954956] [2019-12-07 15:10:28,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:10:28,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:28,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:10:28,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:28,545 INFO L87 Difference]: Start difference. First operand 1719 states and 2681 transitions. Second operand 3 states. [2019-12-07 15:10:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:28,869 INFO L93 Difference]: Finished difference Result 5012 states and 7825 transitions. [2019-12-07 15:10:28,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:10:28,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-12-07 15:10:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:28,882 INFO L225 Difference]: With dead ends: 5012 [2019-12-07 15:10:28,882 INFO L226 Difference]: Without dead ends: 3294 [2019-12-07 15:10:28,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-12-07 15:10:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3292. [2019-12-07 15:10:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3292 states. [2019-12-07 15:10:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5135 transitions. [2019-12-07 15:10:28,931 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5135 transitions. Word has length 163 [2019-12-07 15:10:28,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:28,932 INFO L462 AbstractCegarLoop]: Abstraction has 3292 states and 5135 transitions. [2019-12-07 15:10:28,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:10:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5135 transitions. [2019-12-07 15:10:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 15:10:28,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:28,935 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:28,935 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1356436214, now seen corresponding path program 1 times [2019-12-07 15:10:28,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:28,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448973700] [2019-12-07 15:10:28,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:10:28,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448973700] [2019-12-07 15:10:28,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:28,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:10:28,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213101190] [2019-12-07 15:10:28,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:10:28,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:28,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:10:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:28,987 INFO L87 Difference]: Start difference. First operand 3292 states and 5135 transitions. Second operand 3 states. [2019-12-07 15:10:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:29,599 INFO L93 Difference]: Finished difference Result 9872 states and 15402 transitions. [2019-12-07 15:10:29,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:10:29,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 15:10:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:29,622 INFO L225 Difference]: With dead ends: 9872 [2019-12-07 15:10:29,622 INFO L226 Difference]: Without dead ends: 6581 [2019-12-07 15:10:29,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-12-07 15:10:29,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 6581. [2019-12-07 15:10:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6581 states. [2019-12-07 15:10:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 9394 transitions. [2019-12-07 15:10:29,707 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 9394 transitions. Word has length 165 [2019-12-07 15:10:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:29,707 INFO L462 AbstractCegarLoop]: Abstraction has 6581 states and 9394 transitions. [2019-12-07 15:10:29,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:10:29,707 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 9394 transitions. [2019-12-07 15:10:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 15:10:29,712 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:29,712 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:29,712 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1001989797, now seen corresponding path program 2 times [2019-12-07 15:10:29,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:29,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485403726] [2019-12-07 15:10:29,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:10:29,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485403726] [2019-12-07 15:10:29,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:29,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:10:29,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49583536] [2019-12-07 15:10:29,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:10:29,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:29,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:10:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:29,754 INFO L87 Difference]: Start difference. First operand 6581 states and 9394 transitions. Second operand 3 states. [2019-12-07 15:10:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:30,310 INFO L93 Difference]: Finished difference Result 17737 states and 25327 transitions. [2019-12-07 15:10:30,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:10:30,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-12-07 15:10:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:30,346 INFO L225 Difference]: With dead ends: 17737 [2019-12-07 15:10:30,346 INFO L226 Difference]: Without dead ends: 11157 [2019-12-07 15:10:30,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11157 states. [2019-12-07 15:10:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11157 to 11157. [2019-12-07 15:10:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11157 states. [2019-12-07 15:10:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11157 states to 11157 states and 13989 transitions. [2019-12-07 15:10:30,461 INFO L78 Accepts]: Start accepts. Automaton has 11157 states and 13989 transitions. Word has length 167 [2019-12-07 15:10:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:30,461 INFO L462 AbstractCegarLoop]: Abstraction has 11157 states and 13989 transitions. [2019-12-07 15:10:30,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:10:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 11157 states and 13989 transitions. [2019-12-07 15:10:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 15:10:30,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:30,470 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:30,470 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:30,470 INFO L82 PathProgramCache]: Analyzing trace with hash 908763784, now seen corresponding path program 1 times [2019-12-07 15:10:30,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:30,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073058450] [2019-12-07 15:10:30,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 15:10:30,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073058450] [2019-12-07 15:10:30,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:30,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:10:30,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517406416] [2019-12-07 15:10:30,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:10:30,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:30,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:10:30,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:30,558 INFO L87 Difference]: Start difference. First operand 11157 states and 13989 transitions. Second operand 4 states. [2019-12-07 15:10:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:31,290 INFO L93 Difference]: Finished difference Result 30466 states and 38675 transitions. [2019-12-07 15:10:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:10:31,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-12-07 15:10:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:31,316 INFO L225 Difference]: With dead ends: 30466 [2019-12-07 15:10:31,316 INFO L226 Difference]: Without dead ends: 19310 [2019-12-07 15:10:31,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:31,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19310 states. [2019-12-07 15:10:31,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19310 to 14732. [2019-12-07 15:10:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14732 states. [2019-12-07 15:10:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14732 states to 14732 states and 18256 transitions. [2019-12-07 15:10:31,472 INFO L78 Accepts]: Start accepts. Automaton has 14732 states and 18256 transitions. Word has length 185 [2019-12-07 15:10:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:31,473 INFO L462 AbstractCegarLoop]: Abstraction has 14732 states and 18256 transitions. [2019-12-07 15:10:31,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:10:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 14732 states and 18256 transitions. [2019-12-07 15:10:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-12-07 15:10:31,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:31,482 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:31,482 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:31,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2133683111, now seen corresponding path program 1 times [2019-12-07 15:10:31,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:31,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016607187] [2019-12-07 15:10:31,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 15:10:31,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016607187] [2019-12-07 15:10:31,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:31,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:10:31,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044844552] [2019-12-07 15:10:31,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:10:31,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:31,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:10:31,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:10:31,571 INFO L87 Difference]: Start difference. First operand 14732 states and 18256 transitions. Second operand 5 states. [2019-12-07 15:10:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:32,725 INFO L93 Difference]: Finished difference Result 63646 states and 79196 transitions. [2019-12-07 15:10:32,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:10:32,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-12-07 15:10:32,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:32,779 INFO L225 Difference]: With dead ends: 63646 [2019-12-07 15:10:32,779 INFO L226 Difference]: Without dead ends: 48915 [2019-12-07 15:10:32,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:10:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48915 states. [2019-12-07 15:10:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48915 to 48909. [2019-12-07 15:10:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48909 states. [2019-12-07 15:10:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48909 states to 48909 states and 60865 transitions. [2019-12-07 15:10:33,192 INFO L78 Accepts]: Start accepts. Automaton has 48909 states and 60865 transitions. Word has length 210 [2019-12-07 15:10:33,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:33,192 INFO L462 AbstractCegarLoop]: Abstraction has 48909 states and 60865 transitions. [2019-12-07 15:10:33,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:10:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 48909 states and 60865 transitions. [2019-12-07 15:10:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-12-07 15:10:33,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:33,202 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:33,202 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:33,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash 625366031, now seen corresponding path program 1 times [2019-12-07 15:10:33,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:33,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021223438] [2019-12-07 15:10:33,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:33,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021223438] [2019-12-07 15:10:33,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:33,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:10:33,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934857677] [2019-12-07 15:10:33,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:10:33,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:33,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:10:33,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:33,268 INFO L87 Difference]: Start difference. First operand 48909 states and 60865 transitions. Second operand 3 states. [2019-12-07 15:10:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:34,017 INFO L93 Difference]: Finished difference Result 112689 states and 140247 transitions. [2019-12-07 15:10:34,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:10:34,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-12-07 15:10:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:34,072 INFO L225 Difference]: With dead ends: 112689 [2019-12-07 15:10:34,072 INFO L226 Difference]: Without dead ends: 63781 [2019-12-07 15:10:34,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63781 states. [2019-12-07 15:10:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63781 to 63781. [2019-12-07 15:10:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63781 states. [2019-12-07 15:10:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63781 states to 63781 states and 78039 transitions. [2019-12-07 15:10:34,656 INFO L78 Accepts]: Start accepts. Automaton has 63781 states and 78039 transitions. Word has length 213 [2019-12-07 15:10:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:34,656 INFO L462 AbstractCegarLoop]: Abstraction has 63781 states and 78039 transitions. [2019-12-07 15:10:34,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:10:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 63781 states and 78039 transitions. [2019-12-07 15:10:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-12-07 15:10:34,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:34,668 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:34,669 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:34,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:34,669 INFO L82 PathProgramCache]: Analyzing trace with hash -82804838, now seen corresponding path program 1 times [2019-12-07 15:10:34,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:34,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088840279] [2019-12-07 15:10:34,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 15:10:34,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088840279] [2019-12-07 15:10:34,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591027973] [2019-12-07 15:10:34,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:34,880 INFO L264 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:10:34,889 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:10:34,924 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:10:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:10:34,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:10:34,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-12-07 15:10:34,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255732183] [2019-12-07 15:10:34,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:10:34,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:34,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:10:34,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:10:34,971 INFO L87 Difference]: Start difference. First operand 63781 states and 78039 transitions. Second operand 3 states. [2019-12-07 15:10:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:35,806 INFO L93 Difference]: Finished difference Result 129992 states and 158948 transitions. [2019-12-07 15:10:35,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:10:35,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-12-07 15:10:35,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:35,863 INFO L225 Difference]: With dead ends: 129992 [2019-12-07 15:10:35,863 INFO L226 Difference]: Without dead ends: 66212 [2019-12-07 15:10:35,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 440 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:10:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66212 states. [2019-12-07 15:10:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66212 to 62780. [2019-12-07 15:10:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62780 states. [2019-12-07 15:10:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62780 states to 62780 states and 75210 transitions. [2019-12-07 15:10:36,488 INFO L78 Accepts]: Start accepts. Automaton has 62780 states and 75210 transitions. Word has length 221 [2019-12-07 15:10:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:36,488 INFO L462 AbstractCegarLoop]: Abstraction has 62780 states and 75210 transitions. [2019-12-07 15:10:36,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:10:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 62780 states and 75210 transitions. [2019-12-07 15:10:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-12-07 15:10:36,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:36,504 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 15:10:36,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:36,706 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:36,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:36,706 INFO L82 PathProgramCache]: Analyzing trace with hash 745202077, now seen corresponding path program 1 times [2019-12-07 15:10:36,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:36,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142951582] [2019-12-07 15:10:36,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:36,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142951582] [2019-12-07 15:10:36,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:36,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:10:36,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615916671] [2019-12-07 15:10:36,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:10:36,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:36,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:10:36,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:36,922 INFO L87 Difference]: Start difference. First operand 62780 states and 75210 transitions. Second operand 4 states. [2019-12-07 15:10:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:37,848 INFO L93 Difference]: Finished difference Result 138572 states and 166405 transitions. [2019-12-07 15:10:37,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:10:37,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-12-07 15:10:37,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:37,917 INFO L225 Difference]: With dead ends: 138572 [2019-12-07 15:10:37,917 INFO L226 Difference]: Without dead ends: 75793 [2019-12-07 15:10:37,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75793 states. [2019-12-07 15:10:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75793 to 75793. [2019-12-07 15:10:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75793 states. [2019-12-07 15:10:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75793 states to 75793 states and 87611 transitions. [2019-12-07 15:10:38,643 INFO L78 Accepts]: Start accepts. Automaton has 75793 states and 87611 transitions. Word has length 254 [2019-12-07 15:10:38,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:38,643 INFO L462 AbstractCegarLoop]: Abstraction has 75793 states and 87611 transitions. [2019-12-07 15:10:38,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:10:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 75793 states and 87611 transitions. [2019-12-07 15:10:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-12-07 15:10:38,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:38,658 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:10:38,658 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:38,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1458374243, now seen corresponding path program 1 times [2019-12-07 15:10:38,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:38,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805591738] [2019-12-07 15:10:38,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:10:38,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805591738] [2019-12-07 15:10:38,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:38,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:10:38,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019968310] [2019-12-07 15:10:38,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:10:38,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:38,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:10:38,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:38,976 INFO L87 Difference]: Start difference. First operand 75793 states and 87611 transitions. Second operand 3 states. [2019-12-07 15:10:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:39,743 INFO L93 Difference]: Finished difference Result 152729 states and 177337 transitions. [2019-12-07 15:10:39,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:10:39,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-12-07 15:10:39,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:39,807 INFO L225 Difference]: With dead ends: 152729 [2019-12-07 15:10:39,808 INFO L226 Difference]: Without dead ends: 76937 [2019-12-07 15:10:39,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76937 states. [2019-12-07 15:10:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76937 to 76937. [2019-12-07 15:10:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76937 states. [2019-12-07 15:10:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76937 states to 76937 states and 89655 transitions. [2019-12-07 15:10:40,525 INFO L78 Accepts]: Start accepts. Automaton has 76937 states and 89655 transitions. Word has length 271 [2019-12-07 15:10:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:40,525 INFO L462 AbstractCegarLoop]: Abstraction has 76937 states and 89655 transitions. [2019-12-07 15:10:40,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:10:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 76937 states and 89655 transitions. [2019-12-07 15:10:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-12-07 15:10:40,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:40,534 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 15:10:40,534 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:40,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:40,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1142713788, now seen corresponding path program 2 times [2019-12-07 15:10:40,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:40,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360283825] [2019-12-07 15:10:40,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:10:40,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360283825] [2019-12-07 15:10:40,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:40,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:10:40,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668532134] [2019-12-07 15:10:40,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:10:40,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:40,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:10:40,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:40,747 INFO L87 Difference]: Start difference. First operand 76937 states and 89655 transitions. Second operand 3 states. [2019-12-07 15:10:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:41,554 INFO L93 Difference]: Finished difference Result 163597 states and 190898 transitions. [2019-12-07 15:10:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:10:41,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-12-07 15:10:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:41,626 INFO L225 Difference]: With dead ends: 163597 [2019-12-07 15:10:41,626 INFO L226 Difference]: Without dead ends: 86661 [2019-12-07 15:10:41,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:10:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86661 states. [2019-12-07 15:10:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86661 to 81656. [2019-12-07 15:10:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81656 states. [2019-12-07 15:10:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81656 states to 81656 states and 94492 transitions. [2019-12-07 15:10:42,431 INFO L78 Accepts]: Start accepts. Automaton has 81656 states and 94492 transitions. Word has length 278 [2019-12-07 15:10:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:42,432 INFO L462 AbstractCegarLoop]: Abstraction has 81656 states and 94492 transitions. [2019-12-07 15:10:42,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:10:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 81656 states and 94492 transitions. [2019-12-07 15:10:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-12-07 15:10:42,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:42,443 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 15:10:42,443 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:42,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:42,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2037759983, now seen corresponding path program 1 times [2019-12-07 15:10:42,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:42,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972166120] [2019-12-07 15:10:42,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-12-07 15:10:42,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972166120] [2019-12-07 15:10:42,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476856247] [2019-12-07 15:10:42,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:42,668 INFO L264 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 15:10:42,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-12-07 15:10:42,742 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:10:42,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-12-07 15:10:42,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:10:42,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-12-07 15:10:42,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307105660] [2019-12-07 15:10:42,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:10:42,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:42,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:10:42,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:10:42,823 INFO L87 Difference]: Start difference. First operand 81656 states and 94492 transitions. Second operand 4 states. [2019-12-07 15:10:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:44,293 INFO L93 Difference]: Finished difference Result 234098 states and 270579 transitions. [2019-12-07 15:10:44,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:10:44,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-12-07 15:10:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:44,475 INFO L225 Difference]: With dead ends: 234098 [2019-12-07 15:10:44,475 INFO L226 Difference]: Without dead ends: 152443 [2019-12-07 15:10:44,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 614 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:10:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152443 states. [2019-12-07 15:10:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152443 to 152441. [2019-12-07 15:10:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152441 states. [2019-12-07 15:10:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152441 states to 152441 states and 175888 transitions. [2019-12-07 15:10:46,203 INFO L78 Accepts]: Start accepts. Automaton has 152441 states and 175888 transitions. Word has length 309 [2019-12-07 15:10:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:46,203 INFO L462 AbstractCegarLoop]: Abstraction has 152441 states and 175888 transitions. [2019-12-07 15:10:46,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:10:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 152441 states and 175888 transitions. [2019-12-07 15:10:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-12-07 15:10:46,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:46,238 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 15:10:46,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:46,440 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash -666009490, now seen corresponding path program 1 times [2019-12-07 15:10:46,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:46,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054530968] [2019-12-07 15:10:46,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-12-07 15:10:46,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054530968] [2019-12-07 15:10:46,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:46,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:10:46,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315765070] [2019-12-07 15:10:46,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:10:46,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:46,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:10:46,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:10:46,587 INFO L87 Difference]: Start difference. First operand 152441 states and 175888 transitions. Second operand 5 states. [2019-12-07 15:10:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:48,067 INFO L93 Difference]: Finished difference Result 306313 states and 353532 transitions. [2019-12-07 15:10:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:10:48,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 312 [2019-12-07 15:10:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:48,213 INFO L225 Difference]: With dead ends: 306313 [2019-12-07 15:10:48,213 INFO L226 Difference]: Without dead ends: 153873 [2019-12-07 15:10:48,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:10:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153873 states. [2019-12-07 15:10:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153873 to 152012. [2019-12-07 15:10:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152012 states. [2019-12-07 15:10:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152012 states to 152012 states and 175114 transitions. [2019-12-07 15:10:49,788 INFO L78 Accepts]: Start accepts. Automaton has 152012 states and 175114 transitions. Word has length 312 [2019-12-07 15:10:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:49,789 INFO L462 AbstractCegarLoop]: Abstraction has 152012 states and 175114 transitions. [2019-12-07 15:10:49,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:10:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 152012 states and 175114 transitions. [2019-12-07 15:10:49,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-12-07 15:10:49,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:49,814 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 15:10:49,814 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:49,815 INFO L82 PathProgramCache]: Analyzing trace with hash 920203814, now seen corresponding path program 1 times [2019-12-07 15:10:49,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:49,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542305642] [2019-12-07 15:10:49,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-12-07 15:10:51,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542305642] [2019-12-07 15:10:51,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:51,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:10:51,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143046810] [2019-12-07 15:10:51,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:10:51,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:10:51,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:51,049 INFO L87 Difference]: Start difference. First operand 152012 states and 175114 transitions. Second operand 4 states. [2019-12-07 15:10:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:52,530 INFO L93 Difference]: Finished difference Result 304595 states and 350852 transitions. [2019-12-07 15:10:52,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:10:52,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 341 [2019-12-07 15:10:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:52,673 INFO L225 Difference]: With dead ends: 304595 [2019-12-07 15:10:52,673 INFO L226 Difference]: Without dead ends: 152584 [2019-12-07 15:10:52,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:52,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152584 states. [2019-12-07 15:10:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152584 to 152298. [2019-12-07 15:10:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152298 states. [2019-12-07 15:10:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152298 states to 152298 states and 174950 transitions. [2019-12-07 15:10:54,220 INFO L78 Accepts]: Start accepts. Automaton has 152298 states and 174950 transitions. Word has length 341 [2019-12-07 15:10:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:54,220 INFO L462 AbstractCegarLoop]: Abstraction has 152298 states and 174950 transitions. [2019-12-07 15:10:54,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:10:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 152298 states and 174950 transitions. [2019-12-07 15:10:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-12-07 15:10:54,241 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:54,241 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 15:10:54,241 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:54,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1284876699, now seen corresponding path program 1 times [2019-12-07 15:10:54,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:54,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112554705] [2019-12-07 15:10:54,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-07 15:10:54,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112554705] [2019-12-07 15:10:54,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:10:54,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:10:54,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116391844] [2019-12-07 15:10:54,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:10:54,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:54,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:10:54,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:54,441 INFO L87 Difference]: Start difference. First operand 152298 states and 174950 transitions. Second operand 4 states. [2019-12-07 15:10:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:55,979 INFO L93 Difference]: Finished difference Result 419998 states and 479492 transitions. [2019-12-07 15:10:55,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:10:55,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2019-12-07 15:10:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:56,257 INFO L225 Difference]: With dead ends: 419998 [2019-12-07 15:10:56,257 INFO L226 Difference]: Without dead ends: 267701 [2019-12-07 15:10:56,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:10:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267701 states. [2019-12-07 15:10:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267701 to 258690. [2019-12-07 15:10:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258690 states. [2019-12-07 15:10:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258690 states to 258690 states and 294822 transitions. [2019-12-07 15:10:59,349 INFO L78 Accepts]: Start accepts. Automaton has 258690 states and 294822 transitions. Word has length 346 [2019-12-07 15:10:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:59,350 INFO L462 AbstractCegarLoop]: Abstraction has 258690 states and 294822 transitions. [2019-12-07 15:10:59,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:10:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 258690 states and 294822 transitions. [2019-12-07 15:10:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-12-07 15:10:59,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:59,374 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 15:10:59,374 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:59,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1083936852, now seen corresponding path program 1 times [2019-12-07 15:10:59,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:10:59,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348897634] [2019-12-07 15:10:59,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 216 proven. 8 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-12-07 15:10:59,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348897634] [2019-12-07 15:10:59,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554780631] [2019-12-07 15:10:59,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:59,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:10:59,749 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-12-07 15:10:59,820 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:10:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-12-07 15:10:59,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:10:59,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 9 [2019-12-07 15:10:59,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854819623] [2019-12-07 15:10:59,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:10:59,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:10:59,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:10:59,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:10:59,896 INFO L87 Difference]: Start difference. First operand 258690 states and 294822 transitions. Second operand 4 states. [2019-12-07 15:11:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:11:01,700 INFO L93 Difference]: Finished difference Result 549842 states and 626358 transitions. [2019-12-07 15:11:01,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:11:01,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 367 [2019-12-07 15:11:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:11:02,012 INFO L225 Difference]: With dead ends: 549842 [2019-12-07 15:11:02,012 INFO L226 Difference]: Without dead ends: 291296 [2019-12-07 15:11:02,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 731 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:11:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291296 states. [2019-12-07 15:11:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291296 to 288720. [2019-12-07 15:11:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288720 states. [2019-12-07 15:11:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288720 states to 288720 states and 328443 transitions. [2019-12-07 15:11:05,200 INFO L78 Accepts]: Start accepts. Automaton has 288720 states and 328443 transitions. Word has length 367 [2019-12-07 15:11:05,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:11:05,201 INFO L462 AbstractCegarLoop]: Abstraction has 288720 states and 328443 transitions. [2019-12-07 15:11:05,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:11:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 288720 states and 328443 transitions. [2019-12-07 15:11:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-12-07 15:11:05,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:11:05,242 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:11:05,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:11:05,443 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:11:05,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:11:05,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1718355530, now seen corresponding path program 1 times [2019-12-07 15:11:05,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:11:05,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171264619] [2019-12-07 15:11:05,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:11:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:11:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-07 15:11:05,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171264619] [2019-12-07 15:11:05,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:11:05,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:11:05,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876169292] [2019-12-07 15:11:05,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:11:05,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:11:05,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:11:05,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:11:05,729 INFO L87 Difference]: Start difference. First operand 288720 states and 328443 transitions. Second operand 4 states. [2019-12-07 15:11:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:11:07,975 INFO L93 Difference]: Finished difference Result 608468 states and 696850 transitions. [2019-12-07 15:11:07,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:11:07,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 402 [2019-12-07 15:11:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:11:07,976 INFO L225 Difference]: With dead ends: 608468 [2019-12-07 15:11:07,976 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:11:09,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:11:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:11:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:11:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:11:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:11:09,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 402 [2019-12-07 15:11:09,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:11:09,837 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:11:09,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:11:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:11:09,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:11:09,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 15:11:32,149 WARN L192 SmtUtils]: Spent 22.29 s on a formula simplification. DAG size of input: 2752 DAG size of output: 704 [2019-12-07 15:11:54,353 WARN L192 SmtUtils]: Spent 22.20 s on a formula simplification. DAG size of input: 2752 DAG size of output: 704 [2019-12-07 15:11:59,349 WARN L192 SmtUtils]: Spent 4.99 s on a formula simplification. DAG size of input: 597 DAG size of output: 48 [2019-12-07 15:12:04,156 WARN L192 SmtUtils]: Spent 4.80 s on a formula simplification. DAG size of input: 597 DAG size of output: 48 [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,158 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,159 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,160 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse1 (= ~a27~0 1)) (.cse7 (= 1 ~a6~0))) (let ((.cse0 (<= ~a3~0 0)) (.cse5 (= 1 ~a3~0)) (.cse8 (not (= ~a12~0 1))) (.cse4 (<= ~a27~0 0)) (.cse2 (= 1 ~a5~0)) (.cse3 (= ~a26~0 1)) (.cse6 (or .cse1 .cse7))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4) (and .cse2 (= 1 ~a8~0) (= 0 ~a6~0) (not .cse5) .cse6) (and .cse2 (or .cse7 (= ~a11~0 1))) (and .cse2 (= 2 ~a3~0) .cse3 .cse4) (and .cse2 .cse1 .cse8) (and .cse5 .cse2 .cse8 .cse3 .cse4) (and (= ~a10~0 1) .cse5 .cse2 .cse8 .cse4) (and .cse2 (<= ~a11~0 0) (= ~a29~0 1) .cse3 .cse6)))) [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,161 INFO L246 CegarLoopResult]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1518) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,162 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse1 (= ~a27~0 1)) (.cse7 (= 1 ~a6~0))) (let ((.cse0 (<= ~a3~0 0)) (.cse5 (= 1 ~a3~0)) (.cse8 (not (= ~a12~0 1))) (.cse4 (<= ~a27~0 0)) (.cse2 (= 1 ~a5~0)) (.cse3 (= ~a26~0 1)) (.cse6 (or .cse1 .cse7))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4) (and .cse2 (= 1 ~a8~0) (= 0 ~a6~0) (not .cse5) .cse6) (and .cse2 (or .cse7 (= ~a11~0 1))) (and .cse2 (= 2 ~a3~0) .cse3 .cse4) (and .cse2 .cse1 .cse8) (and .cse5 .cse2 .cse8 .cse3 .cse4) (and (= ~a10~0 1) .cse5 .cse2 .cse8 .cse4) (and .cse2 (<= ~a11~0 0) (= ~a29~0 1) .cse3 .cse6)))) [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,163 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,164 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,165 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,166 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,166 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,166 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,166 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,166 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,166 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,166 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,166 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 15:12:04,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:12:04 BoogieIcfgContainer [2019-12-07 15:12:04,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:12:04,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:12:04,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:12:04,183 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:12:04,183 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:10:24" (3/4) ... [2019-12-07 15:12:04,186 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:12:04,211 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 114 nodes and edges [2019-12-07 15:12:04,214 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-12-07 15:12:04,218 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 15:12:04,222 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 15:12:04,358 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5b3407d7-032a-47c6-9ff6-ba22bef51946/bin/utaipan/witness.graphml [2019-12-07 15:12:04,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:12:04,359 INFO L168 Benchmark]: Toolchain (without parser) took 102584.10 ms. Allocated memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: 4.9 GB). Free memory was 938.0 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-12-07 15:12:04,360 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:12:04,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -79.2 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:12:04,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:12:04,360 INFO L168 Benchmark]: Boogie Preprocessor took 81.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 984.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:12:04,360 INFO L168 Benchmark]: RCFGBuilder took 1835.55 ms. Allocated memory is still 1.1 GB. Free memory was 984.9 MB in the beginning and 797.9 MB in the end (delta: 187.0 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:12:04,361 INFO L168 Benchmark]: TraceAbstraction took 99786.31 ms. Allocated memory was 1.1 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 797.9 MB in the beginning and 2.5 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-12-07 15:12:04,361 INFO L168 Benchmark]: Witness Printer took 176.11 ms. Allocated memory is still 5.9 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 85.9 MB). Peak memory consumption was 85.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:12:04,362 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 608.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -79.2 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 984.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1835.55 ms. Allocated memory is still 1.1 GB. Free memory was 984.9 MB in the beginning and 797.9 MB in the end (delta: 187.0 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 99786.31 ms. Allocated memory was 1.1 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 797.9 MB in the beginning and 2.5 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 176.11 ms. Allocated memory is still 5.9 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 85.9 MB). Peak memory consumption was 85.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1518]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((a3 <= 0 && a27 == 1) && 1 == a5) && a26 == 1) || ((a3 <= 0 && 1 == a5) && a27 <= 0)) || ((((1 == a5 && 1 == a8) && 0 == a6) && !(1 == a3)) && (a27 == 1 || 1 == a6))) || (1 == a5 && (1 == a6 || a11 == 1))) || (((1 == a5 && 2 == a3) && a26 == 1) && a27 <= 0)) || ((1 == a5 && a27 == 1) && !(a12 == 1))) || ((((1 == a3 && 1 == a5) && !(a12 == 1)) && a26 == 1) && a27 <= 0)) || ((((a10 == 1 && 1 == a3) && 1 == a5) && !(a12 == 1)) && a27 <= 0)) || ((((1 == a5 && a11 <= 0) && a29 == 1) && a26 == 1) && (a27 == 1 || 1 == a6)) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((a3 <= 0 && a27 == 1) && 1 == a5) && a26 == 1) || ((a3 <= 0 && 1 == a5) && a27 <= 0)) || ((((1 == a5 && 1 == a8) && 0 == a6) && !(1 == a3)) && (a27 == 1 || 1 == a6))) || (1 == a5 && (1 == a6 || a11 == 1))) || (((1 == a5 && 2 == a3) && a26 == 1) && a27 <= 0)) || ((1 == a5 && a27 == 1) && !(a12 == 1))) || ((((1 == a3 && 1 == a5) && !(a12 == 1)) && a26 == 1) && a27 <= 0)) || ((((a10 == 1 && 1 == a3) && 1 == a5) && !(a12 == 1)) && a27 <= 0)) || ((((1 == a5 && a11 <= 0) && a29 == 1) && a26 == 1) && (a27 == 1 || 1 == a6)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: SAFE, OverallTime: 45.3s, OverallIterations: 21, TraceHistogramMax: 6, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 54.3s, HoareTripleCheckerStatistics: 2589 SDtfs, 6060 SDslu, 925 SDs, 0 SdLazy, 11918 SolverSat, 3025 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1868 GetRequests, 1810 SyntacticMatches, 13 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288720occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 27619 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 4421 NumberOfFragments, 269 HoareAnnotationTreeSize, 3 FomulaSimplifications, 357822 FormulaSimplificationTreeSizeReduction, 44.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 90964 FormulaSimplificationTreeSizeReductionInter, 9.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 5865 NumberOfCodeBlocks, 5865 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6735 ConstructedInterpolants, 0 QuantifiedInterpolants, 3461211 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1692 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 4175/4189 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...