./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label58.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_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label58.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/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 bc3f4f83dc0f9722fad67bdaf812b1845d8e1022 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:15:42,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:15:42,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:15:42,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:15:42,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:15:42,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:15:42,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:15:42,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:15:42,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:15:42,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:15:42,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:15:42,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:15:42,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:15:42,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:15:42,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:15:42,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:15:42,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:15:42,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:15:42,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:15:42,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:15:42,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:15:42,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:15:42,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:15:42,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:15:42,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:15:42,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:15:42,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:15:42,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:15:42,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:15:42,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:15:42,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:15:42,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:15:42,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:15:42,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:15:42,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:15:42,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:15:42,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:15:42,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:15:42,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:15:42,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:15:42,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:15:42,578 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:15:42,588 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:15:42,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:15:42,589 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:15:42,589 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:15:42,589 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:15:42,589 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:15:42,589 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:15:42,589 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:15:42,589 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:15:42,589 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:15:42,590 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:15:42,590 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:15:42,590 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:15:42,590 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:15:42,590 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:15:42,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:15:42,591 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:15:42,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:15:42,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:15:42,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:15:42,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:15:42,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:15:42,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:15:42,592 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:15:42,592 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:15:42,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:15:42,592 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:15:42,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:15:42,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:15:42,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:15:42,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:15:42,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:15:42,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:15:42,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:15:42,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:15:42,593 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:15:42,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:15:42,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:15:42,594 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:15:42,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:15:42,594 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_b691bc6f-7f69-4c08-a06c-ff5f2b040698/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 -> bc3f4f83dc0f9722fad67bdaf812b1845d8e1022 [2019-12-07 12:15:42,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:15:42,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:15:42,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:15:42,713 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:15:42,713 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:15:42,714 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem03_label58.c [2019-12-07 12:15:42,757 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/data/41da58cd1/ea0c74ff2e924e3ea36e9b41e168c2c7/FLAG64a8a992d [2019-12-07 12:15:43,270 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:15:43,271 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/sv-benchmarks/c/eca-rers2012/Problem03_label58.c [2019-12-07 12:15:43,282 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/data/41da58cd1/ea0c74ff2e924e3ea36e9b41e168c2c7/FLAG64a8a992d [2019-12-07 12:15:43,785 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/data/41da58cd1/ea0c74ff2e924e3ea36e9b41e168c2c7 [2019-12-07 12:15:43,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:15:43,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:15:43,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:15:43,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:15:43,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:15:43,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:15:43" (1/1) ... [2019-12-07 12:15:43,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354778c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:43, skipping insertion in model container [2019-12-07 12:15:43,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:15:43" (1/1) ... [2019-12-07 12:15:43,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:15:43,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:15:44,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:15:44,235 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:15:44,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:15:44,385 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:15:44,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44 WrapperNode [2019-12-07 12:15:44,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:15:44,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:15:44,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:15:44,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:15:44,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44" (1/1) ... [2019-12-07 12:15:44,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44" (1/1) ... [2019-12-07 12:15:44,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:15:44,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:15:44,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:15:44,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:15:44,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44" (1/1) ... [2019-12-07 12:15:44,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44" (1/1) ... [2019-12-07 12:15:44,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44" (1/1) ... [2019-12-07 12:15:44,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44" (1/1) ... [2019-12-07 12:15:44,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44" (1/1) ... [2019-12-07 12:15:44,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44" (1/1) ... [2019-12-07 12:15:44,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44" (1/1) ... [2019-12-07 12:15:44,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:15:44,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:15:44,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:15:44,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:15:44,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/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 12:15:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:15:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:15:46,307 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:15:46,307 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:15:46,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:15:46 BoogieIcfgContainer [2019-12-07 12:15:46,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:15:46,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:15:46,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:15:46,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:15:46,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:15:43" (1/3) ... [2019-12-07 12:15:46,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79864224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:15:46, skipping insertion in model container [2019-12-07 12:15:46,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:44" (2/3) ... [2019-12-07 12:15:46,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79864224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:15:46, skipping insertion in model container [2019-12-07 12:15:46,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:15:46" (3/3) ... [2019-12-07 12:15:46,313 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label58.c [2019-12-07 12:15:46,319 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:15:46,323 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:15:46,331 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:15:46,349 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:15:46,349 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:15:46,350 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:15:46,350 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:15:46,350 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:15:46,350 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:15:46,350 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:15:46,350 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:15:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 12:15:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 12:15:46,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:46,372 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 12:15:46,372 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:46,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:46,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1467460331, now seen corresponding path program 1 times [2019-12-07 12:15:46,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:46,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54315845] [2019-12-07 12:15:46,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:46,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54315845] [2019-12-07 12:15:46,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:46,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:15:46,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069007776] [2019-12-07 12:15:46,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:46,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:46,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:46,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:46,741 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-12-07 12:15:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:47,369 INFO L93 Difference]: Finished difference Result 440 states and 860 transitions. [2019-12-07 12:15:47,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:47,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-12-07 12:15:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:47,381 INFO L225 Difference]: With dead ends: 440 [2019-12-07 12:15:47,381 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 12:15:47,384 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 12:15:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 12:15:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-12-07 12:15:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-12-07 12:15:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 549 transitions. [2019-12-07 12:15:47,425 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 549 transitions. Word has length 143 [2019-12-07 12:15:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:47,426 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 549 transitions. [2019-12-07 12:15:47,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 549 transitions. [2019-12-07 12:15:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 12:15:47,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:47,429 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 12:15:47,429 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:47,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:47,429 INFO L82 PathProgramCache]: Analyzing trace with hash 732708791, now seen corresponding path program 1 times [2019-12-07 12:15:47,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:47,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960737693] [2019-12-07 12:15:47,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:47,493 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 12:15:47,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960737693] [2019-12-07 12:15:47,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:47,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:15:47,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287899198] [2019-12-07 12:15:47,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:15:47,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:47,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:15:47,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:15:47,495 INFO L87 Difference]: Start difference. First operand 289 states and 549 transitions. Second operand 4 states. [2019-12-07 12:15:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:48,581 INFO L93 Difference]: Finished difference Result 1149 states and 2191 transitions. [2019-12-07 12:15:48,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:15:48,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 12:15:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:48,586 INFO L225 Difference]: With dead ends: 1149 [2019-12-07 12:15:48,586 INFO L226 Difference]: Without dead ends: 861 [2019-12-07 12:15:48,588 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 12:15:48,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-07 12:15:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 575. [2019-12-07 12:15:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-07 12:15:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1014 transitions. [2019-12-07 12:15:48,617 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1014 transitions. Word has length 148 [2019-12-07 12:15:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:48,617 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1014 transitions. [2019-12-07 12:15:48,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:15:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1014 transitions. [2019-12-07 12:15:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 12:15:48,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:48,623 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 12:15:48,623 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1458028067, now seen corresponding path program 1 times [2019-12-07 12:15:48,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:48,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086871546] [2019-12-07 12:15:48,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:48,676 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 12:15:48,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086871546] [2019-12-07 12:15:48,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:48,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:15:48,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207515341] [2019-12-07 12:15:48,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:48,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:48,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:48,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:48,677 INFO L87 Difference]: Start difference. First operand 575 states and 1014 transitions. Second operand 3 states. [2019-12-07 12:15:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:48,973 INFO L93 Difference]: Finished difference Result 1149 states and 2027 transitions. [2019-12-07 12:15:48,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:48,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-12-07 12:15:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:48,976 INFO L225 Difference]: With dead ends: 1149 [2019-12-07 12:15:48,977 INFO L226 Difference]: Without dead ends: 575 [2019-12-07 12:15:48,978 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 12:15:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-12-07 12:15:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-12-07 12:15:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-07 12:15:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 964 transitions. [2019-12-07 12:15:48,990 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 964 transitions. Word has length 156 [2019-12-07 12:15:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:48,991 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 964 transitions. [2019-12-07 12:15:48,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 964 transitions. [2019-12-07 12:15:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 12:15:48,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:48,993 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 12:15:48,993 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:48,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:48,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1273580321, now seen corresponding path program 1 times [2019-12-07 12:15:48,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:48,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247789357] [2019-12-07 12:15:48,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:49,048 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 12:15:49,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247789357] [2019-12-07 12:15:49,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:49,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:15:49,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213225037] [2019-12-07 12:15:49,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:15:49,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:49,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:15:49,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:15:49,050 INFO L87 Difference]: Start difference. First operand 575 states and 964 transitions. Second operand 4 states. [2019-12-07 12:15:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:49,944 INFO L93 Difference]: Finished difference Result 2295 states and 3852 transitions. [2019-12-07 12:15:49,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:15:49,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 12:15:49,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:49,952 INFO L225 Difference]: With dead ends: 2295 [2019-12-07 12:15:49,952 INFO L226 Difference]: Without dead ends: 1721 [2019-12-07 12:15:49,953 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 12:15:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-12-07 12:15:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1147. [2019-12-07 12:15:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-12-07 12:15:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1820 transitions. [2019-12-07 12:15:49,975 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1820 transitions. Word has length 157 [2019-12-07 12:15:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:49,975 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1820 transitions. [2019-12-07 12:15:49,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:15:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1820 transitions. [2019-12-07 12:15:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 12:15:49,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:49,978 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 12:15:49,978 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:49,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:49,978 INFO L82 PathProgramCache]: Analyzing trace with hash 210122488, now seen corresponding path program 1 times [2019-12-07 12:15:49,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:49,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804655099] [2019-12-07 12:15:49,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:50,020 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 12:15:50,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804655099] [2019-12-07 12:15:50,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:50,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:15:50,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999490627] [2019-12-07 12:15:50,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:50,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:50,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:50,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:50,022 INFO L87 Difference]: Start difference. First operand 1147 states and 1820 transitions. Second operand 3 states. [2019-12-07 12:15:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:50,514 INFO L93 Difference]: Finished difference Result 2865 states and 4524 transitions. [2019-12-07 12:15:50,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:50,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-12-07 12:15:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:50,521 INFO L225 Difference]: With dead ends: 2865 [2019-12-07 12:15:50,521 INFO L226 Difference]: Without dead ends: 1719 [2019-12-07 12:15:50,523 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 12:15:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-12-07 12:15:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-12-07 12:15:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-12-07 12:15:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2681 transitions. [2019-12-07 12:15:50,548 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2681 transitions. Word has length 160 [2019-12-07 12:15:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:50,548 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2681 transitions. [2019-12-07 12:15:50,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2681 transitions. [2019-12-07 12:15:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 12:15:50,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:50,552 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 12:15:50,552 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:50,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:50,552 INFO L82 PathProgramCache]: Analyzing trace with hash 559027547, now seen corresponding path program 1 times [2019-12-07 12:15:50,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:50,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944845474] [2019-12-07 12:15:50,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:50,593 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 12:15:50,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944845474] [2019-12-07 12:15:50,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:50,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:15:50,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287326813] [2019-12-07 12:15:50,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:50,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:50,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:50,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:50,595 INFO L87 Difference]: Start difference. First operand 1719 states and 2681 transitions. Second operand 3 states. [2019-12-07 12:15:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:50,837 INFO L93 Difference]: Finished difference Result 5012 states and 7825 transitions. [2019-12-07 12:15:50,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:50,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-12-07 12:15:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:50,849 INFO L225 Difference]: With dead ends: 5012 [2019-12-07 12:15:50,849 INFO L226 Difference]: Without dead ends: 3294 [2019-12-07 12:15:50,851 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 12:15:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-12-07 12:15:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3292. [2019-12-07 12:15:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3292 states. [2019-12-07 12:15:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5135 transitions. [2019-12-07 12:15:50,899 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5135 transitions. Word has length 163 [2019-12-07 12:15:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:50,899 INFO L462 AbstractCegarLoop]: Abstraction has 3292 states and 5135 transitions. [2019-12-07 12:15:50,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5135 transitions. [2019-12-07 12:15:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 12:15:50,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:50,902 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 12:15:50,903 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1356435958, now seen corresponding path program 1 times [2019-12-07 12:15:50,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:50,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430881108] [2019-12-07 12:15:50,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:50,949 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 12:15:50,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430881108] [2019-12-07 12:15:50,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:50,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:15:50,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041316469] [2019-12-07 12:15:50,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:50,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:50,950 INFO L87 Difference]: Start difference. First operand 3292 states and 5135 transitions. Second operand 3 states. [2019-12-07 12:15:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:51,515 INFO L93 Difference]: Finished difference Result 9872 states and 15402 transitions. [2019-12-07 12:15:51,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:51,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 12:15:51,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:51,538 INFO L225 Difference]: With dead ends: 9872 [2019-12-07 12:15:51,538 INFO L226 Difference]: Without dead ends: 6581 [2019-12-07 12:15:51,541 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 12:15:51,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-12-07 12:15:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 6581. [2019-12-07 12:15:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6581 states. [2019-12-07 12:15:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 9394 transitions. [2019-12-07 12:15:51,622 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 9394 transitions. Word has length 165 [2019-12-07 12:15:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:51,622 INFO L462 AbstractCegarLoop]: Abstraction has 6581 states and 9394 transitions. [2019-12-07 12:15:51,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 9394 transitions. [2019-12-07 12:15:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 12:15:51,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:51,628 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 12:15:51,628 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1001990053, now seen corresponding path program 2 times [2019-12-07 12:15:51,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:51,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363717511] [2019-12-07 12:15:51,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:51,668 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 12:15:51,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363717511] [2019-12-07 12:15:51,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:51,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:15:51,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754238968] [2019-12-07 12:15:51,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:51,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:51,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:51,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:51,670 INFO L87 Difference]: Start difference. First operand 6581 states and 9394 transitions. Second operand 3 states. [2019-12-07 12:15:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:52,194 INFO L93 Difference]: Finished difference Result 17737 states and 25327 transitions. [2019-12-07 12:15:52,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:52,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-12-07 12:15:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:52,230 INFO L225 Difference]: With dead ends: 17737 [2019-12-07 12:15:52,230 INFO L226 Difference]: Without dead ends: 11157 [2019-12-07 12:15:52,235 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 12:15:52,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11157 states. [2019-12-07 12:15:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11157 to 11157. [2019-12-07 12:15:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11157 states. [2019-12-07 12:15:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11157 states to 11157 states and 13989 transitions. [2019-12-07 12:15:52,357 INFO L78 Accepts]: Start accepts. Automaton has 11157 states and 13989 transitions. Word has length 167 [2019-12-07 12:15:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:52,357 INFO L462 AbstractCegarLoop]: Abstraction has 11157 states and 13989 transitions. [2019-12-07 12:15:52,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 11157 states and 13989 transitions. [2019-12-07 12:15:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 12:15:52,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:52,365 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 12:15:52,365 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:52,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash 908763528, now seen corresponding path program 1 times [2019-12-07 12:15:52,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:52,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237250841] [2019-12-07 12:15:52,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:52,419 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 12:15:52,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237250841] [2019-12-07 12:15:52,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:52,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:15:52,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110907307] [2019-12-07 12:15:52,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:15:52,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:52,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:15:52,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:15:52,420 INFO L87 Difference]: Start difference. First operand 11157 states and 13989 transitions. Second operand 4 states. [2019-12-07 12:15:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:53,183 INFO L93 Difference]: Finished difference Result 30466 states and 38675 transitions. [2019-12-07 12:15:53,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:15:53,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-12-07 12:15:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:53,208 INFO L225 Difference]: With dead ends: 30466 [2019-12-07 12:15:53,208 INFO L226 Difference]: Without dead ends: 19310 [2019-12-07 12:15:53,216 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 12:15:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19310 states. [2019-12-07 12:15:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19310 to 14732. [2019-12-07 12:15:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14732 states. [2019-12-07 12:15:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14732 states to 14732 states and 18256 transitions. [2019-12-07 12:15:53,365 INFO L78 Accepts]: Start accepts. Automaton has 14732 states and 18256 transitions. Word has length 185 [2019-12-07 12:15:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:53,365 INFO L462 AbstractCegarLoop]: Abstraction has 14732 states and 18256 transitions. [2019-12-07 12:15:53,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:15:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 14732 states and 18256 transitions. [2019-12-07 12:15:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-12-07 12:15:53,375 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:53,375 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 12:15:53,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:53,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash -2133683367, now seen corresponding path program 1 times [2019-12-07 12:15:53,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:53,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637771867] [2019-12-07 12:15:53,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:53,460 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 12:15:53,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637771867] [2019-12-07 12:15:53,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:53,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:15:53,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785312649] [2019-12-07 12:15:53,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:15:53,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:53,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:15:53,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:15:53,461 INFO L87 Difference]: Start difference. First operand 14732 states and 18256 transitions. Second operand 5 states. [2019-12-07 12:15:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:54,761 INFO L93 Difference]: Finished difference Result 63646 states and 79196 transitions. [2019-12-07 12:15:54,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:15:54,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-12-07 12:15:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:54,818 INFO L225 Difference]: With dead ends: 63646 [2019-12-07 12:15:54,818 INFO L226 Difference]: Without dead ends: 48915 [2019-12-07 12:15:54,829 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 12:15:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48915 states. [2019-12-07 12:15:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48915 to 48909. [2019-12-07 12:15:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48909 states. [2019-12-07 12:15:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48909 states to 48909 states and 60865 transitions. [2019-12-07 12:15:55,238 INFO L78 Accepts]: Start accepts. Automaton has 48909 states and 60865 transitions. Word has length 210 [2019-12-07 12:15:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:55,238 INFO L462 AbstractCegarLoop]: Abstraction has 48909 states and 60865 transitions. [2019-12-07 12:15:55,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:15:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 48909 states and 60865 transitions. [2019-12-07 12:15:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-12-07 12:15:55,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:55,248 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 12:15:55,248 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash 625365775, now seen corresponding path program 1 times [2019-12-07 12:15:55,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:55,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356729326] [2019-12-07 12:15:55,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:55,313 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 12:15:55,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356729326] [2019-12-07 12:15:55,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:55,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:15:55,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390966921] [2019-12-07 12:15:55,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:55,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:55,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:55,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:55,314 INFO L87 Difference]: Start difference. First operand 48909 states and 60865 transitions. Second operand 3 states. [2019-12-07 12:15:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:56,066 INFO L93 Difference]: Finished difference Result 112689 states and 140247 transitions. [2019-12-07 12:15:56,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:56,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-12-07 12:15:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:56,128 INFO L225 Difference]: With dead ends: 112689 [2019-12-07 12:15:56,128 INFO L226 Difference]: Without dead ends: 63781 [2019-12-07 12:15:56,154 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 12:15:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63781 states. [2019-12-07 12:15:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63781 to 63781. [2019-12-07 12:15:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63781 states. [2019-12-07 12:15:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63781 states to 63781 states and 78017 transitions. [2019-12-07 12:15:56,696 INFO L78 Accepts]: Start accepts. Automaton has 63781 states and 78017 transitions. Word has length 213 [2019-12-07 12:15:56,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:56,697 INFO L462 AbstractCegarLoop]: Abstraction has 63781 states and 78017 transitions. [2019-12-07 12:15:56,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 63781 states and 78017 transitions. [2019-12-07 12:15:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-12-07 12:15:56,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:56,709 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 12:15:56,709 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:56,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:56,709 INFO L82 PathProgramCache]: Analyzing trace with hash -82805094, now seen corresponding path program 1 times [2019-12-07 12:15:56,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:56,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652728989] [2019-12-07 12:15:56,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:56,817 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 12:15:56,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652728989] [2019-12-07 12:15:56,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461968941] [2019-12-07 12:15:56,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/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 12:15:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:56,913 INFO L264 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:15:56,921 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:56,958 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 12:15:56,958 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:56,994 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 12:15:56,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:15:56,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-12-07 12:15:56,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091769624] [2019-12-07 12:15:56,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:56,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:56,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:56,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:15:56,996 INFO L87 Difference]: Start difference. First operand 63781 states and 78017 transitions. Second operand 3 states. [2019-12-07 12:15:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:57,877 INFO L93 Difference]: Finished difference Result 129992 states and 158904 transitions. [2019-12-07 12:15:57,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:57,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-12-07 12:15:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:57,942 INFO L225 Difference]: With dead ends: 129992 [2019-12-07 12:15:57,942 INFO L226 Difference]: Without dead ends: 66212 [2019-12-07 12:15:57,971 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 12:15:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66212 states. [2019-12-07 12:15:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66212 to 62780. [2019-12-07 12:15:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62780 states. [2019-12-07 12:15:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62780 states to 62780 states and 75194 transitions. [2019-12-07 12:15:58,580 INFO L78 Accepts]: Start accepts. Automaton has 62780 states and 75194 transitions. Word has length 221 [2019-12-07 12:15:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:58,580 INFO L462 AbstractCegarLoop]: Abstraction has 62780 states and 75194 transitions. [2019-12-07 12:15:58,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 62780 states and 75194 transitions. [2019-12-07 12:15:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-12-07 12:15:58,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:58,597 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, 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] [2019-12-07 12:15:58,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:15:58,798 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:15:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash -583068520, now seen corresponding path program 1 times [2019-12-07 12:15:58,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:15:58,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601729553] [2019-12-07 12:15:58,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:15:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 124 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-12-07 12:15:59,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601729553] [2019-12-07 12:15:59,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904622725] [2019-12-07 12:15:59,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/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 12:15:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:59,131 INFO L264 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:15:59,135 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-07 12:15:59,188 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-07 12:15:59,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:15:59,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-12-07 12:15:59,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322169661] [2019-12-07 12:15:59,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:59,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:59,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:59,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:15:59,234 INFO L87 Difference]: Start difference. First operand 62780 states and 75194 transitions. Second operand 3 states. [2019-12-07 12:16:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:16:00,310 INFO L93 Difference]: Finished difference Result 138858 states and 166731 transitions. [2019-12-07 12:16:00,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:16:00,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-12-07 12:16:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:16:00,393 INFO L225 Difference]: With dead ends: 138858 [2019-12-07 12:16:00,393 INFO L226 Difference]: Without dead ends: 76079 [2019-12-07 12:16:00,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 521 SyntacticMatches, 3 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 12:16:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76079 states. [2019-12-07 12:16:01,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76079 to 76079. [2019-12-07 12:16:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76079 states. [2019-12-07 12:16:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76079 states to 76079 states and 88268 transitions. [2019-12-07 12:16:01,345 INFO L78 Accepts]: Start accepts. Automaton has 76079 states and 88268 transitions. Word has length 262 [2019-12-07 12:16:01,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:16:01,345 INFO L462 AbstractCegarLoop]: Abstraction has 76079 states and 88268 transitions. [2019-12-07 12:16:01,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:16:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 76079 states and 88268 transitions. [2019-12-07 12:16:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-12-07 12:16:01,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:16:01,369 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 12:16:01,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:16:01,569 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:16:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:16:01,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1796661537, now seen corresponding path program 1 times [2019-12-07 12:16:01,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:16:01,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129303583] [2019-12-07 12:16:01,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:16:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:01,743 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 12:16:01,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129303583] [2019-12-07 12:16:01,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:16:01,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:16:01,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439386378] [2019-12-07 12:16:01,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:16:01,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:16:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:16:01,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:16:01,745 INFO L87 Difference]: Start difference. First operand 76079 states and 88268 transitions. Second operand 3 states. [2019-12-07 12:16:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:16:02,527 INFO L93 Difference]: Finished difference Result 154159 states and 179597 transitions. [2019-12-07 12:16:02,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:16:02,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-12-07 12:16:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:16:02,597 INFO L225 Difference]: With dead ends: 154159 [2019-12-07 12:16:02,597 INFO L226 Difference]: Without dead ends: 78081 [2019-12-07 12:16:02,626 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 12:16:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78081 states. [2019-12-07 12:16:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78081 to 77223. [2019-12-07 12:16:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77223 states. [2019-12-07 12:16:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77223 states to 77223 states and 90124 transitions. [2019-12-07 12:16:03,512 INFO L78 Accepts]: Start accepts. Automaton has 77223 states and 90124 transitions. Word has length 271 [2019-12-07 12:16:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:16:03,513 INFO L462 AbstractCegarLoop]: Abstraction has 77223 states and 90124 transitions. [2019-12-07 12:16:03,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:16:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 77223 states and 90124 transitions. [2019-12-07 12:16:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-12-07 12:16:03,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:16:03,522 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, 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 12:16:03,522 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:16:03,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:16:03,522 INFO L82 PathProgramCache]: Analyzing trace with hash 135919026, now seen corresponding path program 1 times [2019-12-07 12:16:03,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:16:03,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858091340] [2019-12-07 12:16:03,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:16:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:16:03,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858091340] [2019-12-07 12:16:03,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563313744] [2019-12-07 12:16:03,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/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 12:16:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:03,799 INFO L264 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:16:03,805 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:16:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:16:03,962 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:16:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:16:04,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:16:04,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2019-12-07 12:16:04,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957310782] [2019-12-07 12:16:04,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:16:04,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:16:04,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:16:04,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:16:04,044 INFO L87 Difference]: Start difference. First operand 77223 states and 90124 transitions. Second operand 4 states. [2019-12-07 12:16:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:16:05,164 INFO L93 Difference]: Finished difference Result 171033 states and 198639 transitions. [2019-12-07 12:16:05,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:16:05,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 274 [2019-12-07 12:16:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:16:05,252 INFO L225 Difference]: With dead ends: 171033 [2019-12-07 12:16:05,252 INFO L226 Difference]: Without dead ends: 93811 [2019-12-07 12:16:05,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 545 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:16:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93811 states. [2019-12-07 12:16:06,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93811 to 81942. [2019-12-07 12:16:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81942 states. [2019-12-07 12:16:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81942 states to 81942 states and 94911 transitions. [2019-12-07 12:16:06,257 INFO L78 Accepts]: Start accepts. Automaton has 81942 states and 94911 transitions. Word has length 274 [2019-12-07 12:16:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:16:06,257 INFO L462 AbstractCegarLoop]: Abstraction has 81942 states and 94911 transitions. [2019-12-07 12:16:06,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:16:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 81942 states and 94911 transitions. [2019-12-07 12:16:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-12-07 12:16:06,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:16:06,266 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, 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] [2019-12-07 12:16:06,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:16:06,467 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:16:06,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:16:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash -909805035, now seen corresponding path program 2 times [2019-12-07 12:16:06,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:16:06,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278744748] [2019-12-07 12:16:06,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:16:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 137 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:16:06,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278744748] [2019-12-07 12:16:06,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256055675] [2019-12-07 12:16:06,616 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:16:06,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 12:16:06,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:16:06,711 INFO L264 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:16:06,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:16:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 12:16:06,802 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:16:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 12:16:06,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1080868653] [2019-12-07 12:16:06,897 INFO L159 IcfgInterpreter]: Started Sifa with 145 locations of interest [2019-12-07 12:16:06,897 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:16:06,902 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:16:06,906 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:16:06,907 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:16:07,403 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-12-07 12:16:07,515 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-12-07 12:16:07,677 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-12-07 12:16:07,780 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-12-07 12:16:09,062 WARN L192 SmtUtils]: Spent 757.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-12-07 12:16:09,245 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 199 [2019-12-07 12:16:22,959 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 17 [2019-12-07 12:16:23,066 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 17 [2019-12-07 12:16:23,194 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 17 [2019-12-07 12:16:30,738 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:16:32,026 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 168 DAG size of output: 162 [2019-12-07 12:16:33,306 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 171 DAG size of output: 165 [2019-12-07 12:16:33,774 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 148 [2019-12-07 12:16:34,051 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2019-12-07 12:16:34,515 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 145 [2019-12-07 12:16:35,598 WARN L192 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 155 [2019-12-07 12:16:36,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:16:36,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 11 [2019-12-07 12:16:36,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171264689] [2019-12-07 12:16:36,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:16:36,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:16:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:16:36,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:16:36,609 INFO L87 Difference]: Start difference. First operand 81942 states and 94911 transitions. Second operand 8 states. [2019-12-07 12:16:37,113 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 146 [2019-12-07 12:16:38,022 WARN L192 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 154 [2019-12-07 12:16:40,337 WARN L192 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 152 [2019-12-07 12:16:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:16:42,450 INFO L93 Difference]: Finished difference Result 164170 states and 190157 transitions. [2019-12-07 12:16:42,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:16:42,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 281 [2019-12-07 12:16:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:16:42,523 INFO L225 Difference]: With dead ends: 164170 [2019-12-07 12:16:42,524 INFO L226 Difference]: Without dead ends: 82229 [2019-12-07 12:16:42,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 798 SyntacticMatches, 36 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:16:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82229 states. [2019-12-07 12:16:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82229 to 82219. [2019-12-07 12:16:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82219 states. [2019-12-07 12:16:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82219 states to 82219 states and 95206 transitions. [2019-12-07 12:16:43,289 INFO L78 Accepts]: Start accepts. Automaton has 82219 states and 95206 transitions. Word has length 281 [2019-12-07 12:16:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:16:43,289 INFO L462 AbstractCegarLoop]: Abstraction has 82219 states and 95206 transitions. [2019-12-07 12:16:43,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:16:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 82219 states and 95206 transitions. [2019-12-07 12:16:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-12-07 12:16:43,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:16:43,301 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 12:16:43,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:16:43,502 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:16:43,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:16:43,502 INFO L82 PathProgramCache]: Analyzing trace with hash -666009746, now seen corresponding path program 1 times [2019-12-07 12:16:43,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:16:43,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597343544] [2019-12-07 12:16:43,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:16:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:43,616 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 12:16:43,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597343544] [2019-12-07 12:16:43,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:16:43,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:16:43,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057486745] [2019-12-07 12:16:43,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:16:43,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:16:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:16:43,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:16:43,617 INFO L87 Difference]: Start difference. First operand 82219 states and 95206 transitions. Second operand 5 states. [2019-12-07 12:16:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:16:44,777 INFO L93 Difference]: Finished difference Result 166160 states and 192581 transitions. [2019-12-07 12:16:44,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:16:44,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 312 [2019-12-07 12:16:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:16:44,842 INFO L225 Difference]: With dead ends: 166160 [2019-12-07 12:16:44,842 INFO L226 Difference]: Without dead ends: 84080 [2019-12-07 12:16:44,873 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 12:16:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84080 states. [2019-12-07 12:16:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84080 to 82934. [2019-12-07 12:16:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82934 states. [2019-12-07 12:16:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82934 states to 82934 states and 96008 transitions. [2019-12-07 12:16:45,586 INFO L78 Accepts]: Start accepts. Automaton has 82934 states and 96008 transitions. Word has length 312 [2019-12-07 12:16:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:16:45,586 INFO L462 AbstractCegarLoop]: Abstraction has 82934 states and 96008 transitions. [2019-12-07 12:16:45,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:16:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 82934 states and 96008 transitions. [2019-12-07 12:16:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-12-07 12:16:45,602 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:16:45,603 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 12:16:45,603 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:16:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:16:45,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1083936596, now seen corresponding path program 1 times [2019-12-07 12:16:45,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:16:45,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230981913] [2019-12-07 12:16:45,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:16:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:45,851 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 12:16:45,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230981913] [2019-12-07 12:16:45,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346551484] [2019-12-07 12:16:45,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:16:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:45,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:16:45,982 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:16:46,048 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 12:16:46,048 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:16:46,217 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 12:16:46,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:16:46,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 9 [2019-12-07 12:16:46,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699327297] [2019-12-07 12:16:46,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:16:46,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:16:46,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:16:46,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:16:46,219 INFO L87 Difference]: Start difference. First operand 82934 states and 96008 transitions. Second operand 4 states. [2019-12-07 12:16:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:16:47,142 INFO L93 Difference]: Finished difference Result 176742 states and 204235 transitions. [2019-12-07 12:16:47,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:16:47,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 367 [2019-12-07 12:16:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:16:47,142 INFO L225 Difference]: With dead ends: 176742 [2019-12-07 12:16:47,143 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:16:47,180 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 12:16:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:16:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:16:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:16:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:16:47,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 367 [2019-12-07 12:16:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:16:47,181 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:16:47,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:16:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:16:47,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:16:47,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:16:47,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:16:50,356 WARN L192 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 1261 DAG size of output: 405 [2019-12-07 12:16:52,522 WARN L192 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 1258 DAG size of output: 263 [2019-12-07 12:16:54,940 WARN L192 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 383 DAG size of output: 42 [2019-12-07 12:16:55,828 WARN L192 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 42 [2019-12-07 12:16:55,830 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,830 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,830 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,830 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,830 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,831 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,832 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,833 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,834 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,835 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse6 (= ~a27~0 1)) (.cse7 (= ~a11~0 1)) (.cse1 (= 1 ~a6~0))) (let ((.cse4 (not .cse1)) (.cse5 (not .cse7)) (.cse3 (not (= ~a12~0 1))) (.cse0 (= 1 ~a5~0)) (.cse2 (or (and (= ~a27~0 0) .cse7) (and (= ~a11~0 0) .cse6)))) (or (and .cse0 (or .cse1 (= ~a26~0 1))) (and .cse0 .cse2 .cse3 .cse4) (and (<= ~a3~0 1) (= ~a10~0 1) .cse0 .cse3 .cse4 .cse5) (and (<= ~a3~0 0) .cse0 .cse5) (and .cse0 .cse6 .cse3) (and .cse0 .cse2 (= 1 ~a8~0) (= 0 ~a6~0))))) [2019-12-07 12:16:55,835 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,835 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,835 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,835 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1515) no Hoare annotation was computed. [2019-12-07 12:16:55,835 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,835 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 12:16:55,835 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,835 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,835 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,835 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,835 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,835 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse6 (= ~a27~0 1)) (.cse7 (= ~a11~0 1)) (.cse1 (= 1 ~a6~0))) (let ((.cse4 (not .cse1)) (.cse5 (not .cse7)) (.cse3 (not (= ~a12~0 1))) (.cse0 (= 1 ~a5~0)) (.cse2 (or (and (= ~a27~0 0) .cse7) (and (= ~a11~0 0) .cse6)))) (or (and .cse0 (or .cse1 (= ~a26~0 1))) (and .cse0 .cse2 .cse3 .cse4) (and (<= ~a3~0 1) (= ~a10~0 1) .cse0 .cse3 .cse4 .cse5) (and (<= ~a3~0 0) .cse0 .cse5) (and .cse0 .cse6 .cse3) (and .cse0 .cse2 (= 1 ~a8~0) (= 0 ~a6~0))))) [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,836 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,837 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,838 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,839 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,840 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,840 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,840 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,840 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,840 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,840 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,840 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,840 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 12:16:55,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:16:55 BoogieIcfgContainer [2019-12-07 12:16:55,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:16:55,855 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:16:55,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:16:55,855 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:16:55,856 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:15:46" (3/4) ... [2019-12-07 12:16:55,858 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:16:55,879 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 115 nodes and edges [2019-12-07 12:16:55,882 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 12:16:55,885 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 12:16:55,887 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 12:16:56,017 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b691bc6f-7f69-4c08-a06c-ff5f2b040698/bin/utaipan/witness.graphml [2019-12-07 12:16:56,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:16:56,018 INFO L168 Benchmark]: Toolchain (without parser) took 72229.94 ms. Allocated memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: 4.2 GB). Free memory was 932.6 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-12-07 12:16:56,018 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:16:56,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 596.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 932.6 MB in the beginning and 1.0 GB in the end (delta: -79.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:16:56,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 996.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:16:56,019 INFO L168 Benchmark]: Boogie Preprocessor took 61.70 ms. Allocated memory is still 1.1 GB. Free memory was 996.0 MB in the beginning and 979.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 12:16:56,019 INFO L168 Benchmark]: RCFGBuilder took 1782.41 ms. Allocated memory is still 1.1 GB. Free memory was 979.9 MB in the beginning and 795.6 MB in the end (delta: 184.3 MB). Peak memory consumption was 189.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:16:56,019 INFO L168 Benchmark]: TraceAbstraction took 69546.08 ms. Allocated memory was 1.1 GB in the beginning and 5.2 GB in the end (delta: 4.1 GB). Free memory was 795.6 MB in the beginning and 2.6 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-12-07 12:16:56,019 INFO L168 Benchmark]: Witness Printer took 161.58 ms. Allocated memory is still 5.2 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:16:56,021 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 596.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 932.6 MB in the beginning and 1.0 GB in the end (delta: -79.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 996.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.70 ms. Allocated memory is still 1.1 GB. Free memory was 996.0 MB in the beginning and 979.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1782.41 ms. Allocated memory is still 1.1 GB. Free memory was 979.9 MB in the beginning and 795.6 MB in the end (delta: 184.3 MB). Peak memory consumption was 189.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69546.08 ms. Allocated memory was 1.1 GB in the beginning and 5.2 GB in the end (delta: 4.1 GB). Free memory was 795.6 MB in the beginning and 2.6 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 161.58 ms. Allocated memory is still 5.2 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1515]: 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: (((((1 == a5 && (1 == a6 || a26 == 1)) || (((1 == a5 && ((a27 == 0 && a11 == 1) || (a11 == 0 && a27 == 1))) && !(a12 == 1)) && !(1 == a6))) || (((((a3 <= 1 && a10 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && !(a11 == 1))) || ((a3 <= 0 && 1 == a5) && !(a11 == 1))) || ((1 == a5 && a27 == 1) && !(a12 == 1))) || (((1 == a5 && ((a27 == 0 && a11 == 1) || (a11 == 0 && a27 == 1))) && 1 == a8) && 0 == a6) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((1 == a5 && (1 == a6 || a26 == 1)) || (((1 == a5 && ((a27 == 0 && a11 == 1) || (a11 == 0 && a27 == 1))) && !(a12 == 1)) && !(1 == a6))) || (((((a3 <= 1 && a10 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && !(a11 == 1))) || ((a3 <= 0 && 1 == a5) && !(a11 == 1))) || ((1 == a5 && a27 == 1) && !(a12 == 1))) || (((1 == a5 && ((a27 == 0 && a11 == 1) || (a11 == 0 && a27 == 1))) && 1 == a8) && 0 == a6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: SAFE, OverallTime: 61.0s, OverallIterations: 18, TraceHistogramMax: 6, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.4s, HoareTripleCheckerStatistics: 2182 SDtfs, 4604 SDslu, 593 SDs, 0 SdLazy, 10775 SolverSat, 2535 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3149 GetRequests, 3052 SyntacticMatches, 46 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82934occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 22761 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1296 NumberOfFragments, 217 HoareAnnotationTreeSize, 3 FomulaSimplifications, 103244 FormulaSimplificationTreeSizeReduction, 5.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 24480 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 5260 NumberOfCodeBlocks, 5129 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6637 ConstructedInterpolants, 0 QuantifiedInterpolants, 4336326 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2373 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 3337/3641 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 23841, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 148, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 328, TOOLS_POST_TIME[ms]: 91, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 280, TOOLS_QUANTIFIERELIM_TIME[ms]: 36, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 8, FLUID_QUERY_TIME[ms]: 14, FLUID_QUERIES: 483, FLUID_YES_ANSWERS: 341, DOMAIN_JOIN_APPLICATIONS: 8, DOMAIN_JOIN_TIME[ms]: 518, DOMAIN_ALPHA_APPLICATIONS: 341, DOMAIN_ALPHA_TIME[ms]: 22436, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 195, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME[ms]: 12, DOMAIN_ISBOTTOM_APPLICATIONS: 148, DOMAIN_ISBOTTOM_TIME[ms]: 288, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 6889, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 6888, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 13, REGEX_TO_DAG_TIME[ms]: 9, DAG_COMPRESSION_TIME[ms]: 211, DAG_COMPRESSION_PROCESSED_NODES: 17277, DAG_COMPRESSION_RETAINED_NODES: 475, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...