./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_net_1.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_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_net_1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/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 7e30af526e16c58deb50a12d2f5da235c49261ec ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:45:51,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:45:51,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:45:51,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:45:51,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:45:51,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:45:51,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:45:51,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:45:51,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:45:51,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:45:51,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:45:51,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:45:51,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:45:51,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:45:51,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:45:51,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:45:51,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:45:51,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:45:51,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:45:51,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:45:51,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:45:51,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:45:51,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:45:51,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:45:51,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:45:51,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:45:51,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:45:51,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:45:51,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:45:51,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:45:51,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:45:51,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:45:51,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:45:51,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:45:51,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:45:51,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:45:51,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:45:51,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:45:51,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:45:51,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:45:51,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:45:51,530 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:45:51,543 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:45:51,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:45:51,544 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:45:51,544 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:45:51,544 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:45:51,544 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:45:51,545 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:45:51,545 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:45:51,545 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:45:51,545 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:45:51,545 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:45:51,545 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:45:51,546 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:45:51,546 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:45:51,546 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:45:51,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:45:51,547 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:45:51,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:45:51,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:45:51,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:45:51,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:45:51,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:45:51,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:45:51,548 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:45:51,548 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:45:51,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:45:51,549 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:45:51,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:45:51,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:45:51,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:45:51,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:45:51,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:45:51,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:45:51,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:45:51,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:45:51,550 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:45:51,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:45:51,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:45:51,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:45:51,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:45:51,550 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_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/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 -> 7e30af526e16c58deb50a12d2f5da235c49261ec [2019-12-07 16:45:51,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:45:51,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:45:51,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:45:51,664 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:45:51,665 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:45:51,665 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/bin/utaipan/../../sv-benchmarks/c/psyco/psyco_net_1.c [2019-12-07 16:45:51,705 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/bin/utaipan/data/a859baccf/5483294dfdff47a084278349bcec68bd/FLAG760b5668f [2019-12-07 16:45:52,335 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:45:52,336 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/sv-benchmarks/c/psyco/psyco_net_1.c [2019-12-07 16:45:52,410 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/bin/utaipan/data/a859baccf/5483294dfdff47a084278349bcec68bd/FLAG760b5668f [2019-12-07 16:45:52,691 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/bin/utaipan/data/a859baccf/5483294dfdff47a084278349bcec68bd [2019-12-07 16:45:52,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:45:52,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:45:52,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:45:52,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:45:52,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:45:52,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:45:52" (1/1) ... [2019-12-07 16:45:52,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa9bba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:52, skipping insertion in model container [2019-12-07 16:45:52,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:45:52" (1/1) ... [2019-12-07 16:45:52,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:45:53,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:45:54,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:45:54,035 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:45:54,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:45:54,639 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:45:54,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54 WrapperNode [2019-12-07 16:45:54,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:45:54,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:45:54,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:45:54,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:45:54,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54" (1/1) ... [2019-12-07 16:45:54,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54" (1/1) ... [2019-12-07 16:45:55,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:45:55,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:45:55,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:45:55,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:45:55,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54" (1/1) ... [2019-12-07 16:45:55,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54" (1/1) ... [2019-12-07 16:45:55,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54" (1/1) ... [2019-12-07 16:45:55,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54" (1/1) ... [2019-12-07 16:45:55,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54" (1/1) ... [2019-12-07 16:45:55,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54" (1/1) ... [2019-12-07 16:45:55,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54" (1/1) ... [2019-12-07 16:45:55,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:45:55,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:45:55,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:45:55,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:45:55,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/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 16:45:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:45:55,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:46:07,277 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:46:07,277 INFO L287 CfgBuilder]: Removed 1134 assume(true) statements. [2019-12-07 16:46:07,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:46:07 BoogieIcfgContainer [2019-12-07 16:46:07,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:46:07,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:46:07,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:46:07,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:46:07,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:45:52" (1/3) ... [2019-12-07 16:46:07,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794be7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:46:07, skipping insertion in model container [2019-12-07 16:46:07,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:45:54" (2/3) ... [2019-12-07 16:46:07,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794be7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:46:07, skipping insertion in model container [2019-12-07 16:46:07,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:46:07" (3/3) ... [2019-12-07 16:46:07,289 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_net_1.c [2019-12-07 16:46:07,295 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:46:07,305 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:46:07,313 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:46:07,347 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:46:07,347 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:46:07,347 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:46:07,347 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:46:07,347 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:46:07,347 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:46:07,347 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:46:07,348 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:46:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 9209 states. [2019-12-07 16:46:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 16:46:07,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:07,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:46:07,435 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:07,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash 182211473, now seen corresponding path program 1 times [2019-12-07 16:46:07,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:07,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344133810] [2019-12-07 16:46:07,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:07,606 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 16:46:07,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344133810] [2019-12-07 16:46:07,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:07,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:46:07,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384585348] [2019-12-07 16:46:07,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 16:46:07,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:07,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 16:46:07,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 16:46:07,622 INFO L87 Difference]: Start difference. First operand 9209 states. Second operand 2 states. [2019-12-07 16:46:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:07,796 INFO L93 Difference]: Finished difference Result 17695 states and 35377 transitions. [2019-12-07 16:46:07,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 16:46:07,797 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-12-07 16:46:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:07,842 INFO L225 Difference]: With dead ends: 17695 [2019-12-07 16:46:07,842 INFO L226 Difference]: Without dead ends: 8279 [2019-12-07 16:46:07,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 16:46:07,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8279 states. [2019-12-07 16:46:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8279 to 8279. [2019-12-07 16:46:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8279 states. [2019-12-07 16:46:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8279 states to 8279 states and 12996 transitions. [2019-12-07 16:46:08,015 INFO L78 Accepts]: Start accepts. Automaton has 8279 states and 12996 transitions. Word has length 8 [2019-12-07 16:46:08,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:08,015 INFO L462 AbstractCegarLoop]: Abstraction has 8279 states and 12996 transitions. [2019-12-07 16:46:08,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 16:46:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 8279 states and 12996 transitions. [2019-12-07 16:46:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:46:08,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:08,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:46:08,016 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:08,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:08,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1884649833, now seen corresponding path program 1 times [2019-12-07 16:46:08,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:08,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602518713] [2019-12-07 16:46:08,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:08,083 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 16:46:08,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602518713] [2019-12-07 16:46:08,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:08,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:46:08,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769897946] [2019-12-07 16:46:08,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:08,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:08,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:08,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:08,085 INFO L87 Difference]: Start difference. First operand 8279 states and 12996 transitions. Second operand 3 states. [2019-12-07 16:46:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:09,550 INFO L93 Difference]: Finished difference Result 16560 states and 25995 transitions. [2019-12-07 16:46:09,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:09,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 16:46:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:09,583 INFO L225 Difference]: With dead ends: 16560 [2019-12-07 16:46:09,583 INFO L226 Difference]: Without dead ends: 8282 [2019-12-07 16:46:09,592 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 16:46:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8282 states. [2019-12-07 16:46:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8282 to 8282. [2019-12-07 16:46:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8282 states. [2019-12-07 16:46:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8282 states to 8282 states and 12999 transitions. [2019-12-07 16:46:09,723 INFO L78 Accepts]: Start accepts. Automaton has 8282 states and 12999 transitions. Word has length 9 [2019-12-07 16:46:09,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:09,723 INFO L462 AbstractCegarLoop]: Abstraction has 8282 states and 12999 transitions. [2019-12-07 16:46:09,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:46:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8282 states and 12999 transitions. [2019-12-07 16:46:09,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:46:09,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:09,724 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:46:09,724 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:09,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 897026676, now seen corresponding path program 1 times [2019-12-07 16:46:09,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:09,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747106856] [2019-12-07 16:46:09,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:46:09,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747106856] [2019-12-07 16:46:09,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:09,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:46:09,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794241535] [2019-12-07 16:46:09,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:09,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:09,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:09,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:09,793 INFO L87 Difference]: Start difference. First operand 8282 states and 12999 transitions. Second operand 3 states. [2019-12-07 16:46:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:11,063 INFO L93 Difference]: Finished difference Result 16455 states and 25844 transitions. [2019-12-07 16:46:11,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:11,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 16:46:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:11,104 INFO L225 Difference]: With dead ends: 16455 [2019-12-07 16:46:11,104 INFO L226 Difference]: Without dead ends: 8175 [2019-12-07 16:46:11,115 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 16:46:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8175 states. [2019-12-07 16:46:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8175 to 8175. [2019-12-07 16:46:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8175 states. [2019-12-07 16:46:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8175 states to 8175 states and 12845 transitions. [2019-12-07 16:46:11,292 INFO L78 Accepts]: Start accepts. Automaton has 8175 states and 12845 transitions. Word has length 14 [2019-12-07 16:46:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:11,292 INFO L462 AbstractCegarLoop]: Abstraction has 8175 states and 12845 transitions. [2019-12-07 16:46:11,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:46:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 8175 states and 12845 transitions. [2019-12-07 16:46:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:46:11,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:11,293 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:46:11,293 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:11,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1409738145, now seen corresponding path program 1 times [2019-12-07 16:46:11,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:11,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321022620] [2019-12-07 16:46:11,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:46:11,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321022620] [2019-12-07 16:46:11,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:11,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:46:11,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621880591] [2019-12-07 16:46:11,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:11,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:11,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:11,348 INFO L87 Difference]: Start difference. First operand 8175 states and 12845 transitions. Second operand 3 states. [2019-12-07 16:46:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:13,582 INFO L93 Difference]: Finished difference Result 16263 states and 25562 transitions. [2019-12-07 16:46:13,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:13,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:46:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:13,594 INFO L225 Difference]: With dead ends: 16263 [2019-12-07 16:46:13,594 INFO L226 Difference]: Without dead ends: 8055 [2019-12-07 16:46:13,602 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 16:46:13,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8055 states. [2019-12-07 16:46:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8055 to 8055. [2019-12-07 16:46:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8055 states. [2019-12-07 16:46:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8055 states to 8055 states and 12225 transitions. [2019-12-07 16:46:13,694 INFO L78 Accepts]: Start accepts. Automaton has 8055 states and 12225 transitions. Word has length 18 [2019-12-07 16:46:13,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:13,694 INFO L462 AbstractCegarLoop]: Abstraction has 8055 states and 12225 transitions. [2019-12-07 16:46:13,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:46:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 8055 states and 12225 transitions. [2019-12-07 16:46:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:46:13,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:13,695 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:46:13,696 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:13,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:13,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1274170145, now seen corresponding path program 1 times [2019-12-07 16:46:13,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:13,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509115574] [2019-12-07 16:46:13,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:46:13,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509115574] [2019-12-07 16:46:13,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:13,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:46:13,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766041890] [2019-12-07 16:46:13,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:13,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:13,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:13,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:13,739 INFO L87 Difference]: Start difference. First operand 8055 states and 12225 transitions. Second operand 3 states. [2019-12-07 16:46:14,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:14,817 INFO L93 Difference]: Finished difference Result 16109 states and 24448 transitions. [2019-12-07 16:46:14,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:14,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 16:46:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:14,829 INFO L225 Difference]: With dead ends: 16109 [2019-12-07 16:46:14,830 INFO L226 Difference]: Without dead ends: 8061 [2019-12-07 16:46:14,836 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 16:46:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8061 states. [2019-12-07 16:46:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8061 to 8059. [2019-12-07 16:46:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8059 states. [2019-12-07 16:46:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8059 states to 8059 states and 12229 transitions. [2019-12-07 16:46:14,909 INFO L78 Accepts]: Start accepts. Automaton has 8059 states and 12229 transitions. Word has length 21 [2019-12-07 16:46:14,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:14,910 INFO L462 AbstractCegarLoop]: Abstraction has 8059 states and 12229 transitions. [2019-12-07 16:46:14,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:46:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 8059 states and 12229 transitions. [2019-12-07 16:46:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:46:14,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:14,910 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:46:14,910 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:14,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:14,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1096116993, now seen corresponding path program 1 times [2019-12-07 16:46:14,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:14,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838199869] [2019-12-07 16:46:14,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:46:14,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838199869] [2019-12-07 16:46:14,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:14,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:46:14,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864345194] [2019-12-07 16:46:14,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:14,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:14,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:14,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:14,951 INFO L87 Difference]: Start difference. First operand 8059 states and 12229 transitions. Second operand 3 states. [2019-12-07 16:46:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:18,169 INFO L93 Difference]: Finished difference Result 24163 states and 36671 transitions. [2019-12-07 16:46:18,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:18,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 16:46:18,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:18,197 INFO L225 Difference]: With dead ends: 24163 [2019-12-07 16:46:18,197 INFO L226 Difference]: Without dead ends: 16063 [2019-12-07 16:46:18,206 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 16:46:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16063 states. [2019-12-07 16:46:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16063 to 14805. [2019-12-07 16:46:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14805 states. [2019-12-07 16:46:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14805 states to 14805 states and 23041 transitions. [2019-12-07 16:46:18,351 INFO L78 Accepts]: Start accepts. Automaton has 14805 states and 23041 transitions. Word has length 22 [2019-12-07 16:46:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:18,351 INFO L462 AbstractCegarLoop]: Abstraction has 14805 states and 23041 transitions. [2019-12-07 16:46:18,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:46:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 14805 states and 23041 transitions. [2019-12-07 16:46:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:46:18,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:18,352 INFO L410 BasicCegarLoop]: trace histogram [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 16:46:18,352 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1423449426, now seen corresponding path program 1 times [2019-12-07 16:46:18,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:18,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841028781] [2019-12-07 16:46:18,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:46:18,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841028781] [2019-12-07 16:46:18,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:18,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:46:18,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906519418] [2019-12-07 16:46:18,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:18,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:18,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:18,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:18,400 INFO L87 Difference]: Start difference. First operand 14805 states and 23041 transitions. Second operand 3 states. [2019-12-07 16:46:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:24,199 INFO L93 Difference]: Finished difference Result 37335 states and 57903 transitions. [2019-12-07 16:46:24,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:24,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 16:46:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:24,217 INFO L225 Difference]: With dead ends: 37335 [2019-12-07 16:46:24,217 INFO L226 Difference]: Without dead ends: 22265 [2019-12-07 16:46:24,228 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 16:46:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22265 states. [2019-12-07 16:46:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22265 to 21071. [2019-12-07 16:46:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21071 states. [2019-12-07 16:46:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21071 states to 21071 states and 32683 transitions. [2019-12-07 16:46:24,436 INFO L78 Accepts]: Start accepts. Automaton has 21071 states and 32683 transitions. Word has length 24 [2019-12-07 16:46:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:24,437 INFO L462 AbstractCegarLoop]: Abstraction has 21071 states and 32683 transitions. [2019-12-07 16:46:24,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:46:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 21071 states and 32683 transitions. [2019-12-07 16:46:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:46:24,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:24,438 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:46:24,438 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:24,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:24,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1092028023, now seen corresponding path program 1 times [2019-12-07 16:46:24,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:24,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196025471] [2019-12-07 16:46:24,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:46:24,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196025471] [2019-12-07 16:46:24,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:24,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:46:24,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711876752] [2019-12-07 16:46:24,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:24,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:24,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:24,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:24,492 INFO L87 Difference]: Start difference. First operand 21071 states and 32683 transitions. Second operand 3 states. [2019-12-07 16:46:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:31,528 INFO L93 Difference]: Finished difference Result 63169 states and 97973 transitions. [2019-12-07 16:46:31,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:31,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 16:46:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:31,593 INFO L225 Difference]: With dead ends: 63169 [2019-12-07 16:46:31,593 INFO L226 Difference]: Without dead ends: 42105 [2019-12-07 16:46:31,609 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 16:46:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42105 states. [2019-12-07 16:46:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42105 to 40079. [2019-12-07 16:46:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40079 states. [2019-12-07 16:46:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40079 states to 40079 states and 63057 transitions. [2019-12-07 16:46:32,039 INFO L78 Accepts]: Start accepts. Automaton has 40079 states and 63057 transitions. Word has length 29 [2019-12-07 16:46:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:32,039 INFO L462 AbstractCegarLoop]: Abstraction has 40079 states and 63057 transitions. [2019-12-07 16:46:32,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:46:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 40079 states and 63057 transitions. [2019-12-07 16:46:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 16:46:32,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:32,041 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:46:32,041 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:32,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:32,041 INFO L82 PathProgramCache]: Analyzing trace with hash -504887773, now seen corresponding path program 1 times [2019-12-07 16:46:32,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:32,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190345862] [2019-12-07 16:46:32,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:46:32,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190345862] [2019-12-07 16:46:32,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:32,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:46:32,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401220960] [2019-12-07 16:46:32,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:32,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:32,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:32,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:32,088 INFO L87 Difference]: Start difference. First operand 40079 states and 63057 transitions. Second operand 3 states. [2019-12-07 16:46:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:35,433 INFO L93 Difference]: Finished difference Result 107941 states and 170043 transitions. [2019-12-07 16:46:35,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:35,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-12-07 16:46:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:35,515 INFO L225 Difference]: With dead ends: 107941 [2019-12-07 16:46:35,515 INFO L226 Difference]: Without dead ends: 67821 [2019-12-07 16:46:35,543 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 16:46:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67821 states. [2019-12-07 16:46:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67821 to 66147. [2019-12-07 16:46:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66147 states. [2019-12-07 16:46:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66147 states to 66147 states and 104777 transitions. [2019-12-07 16:46:36,155 INFO L78 Accepts]: Start accepts. Automaton has 66147 states and 104777 transitions. Word has length 38 [2019-12-07 16:46:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:36,155 INFO L462 AbstractCegarLoop]: Abstraction has 66147 states and 104777 transitions. [2019-12-07 16:46:36,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:46:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 66147 states and 104777 transitions. [2019-12-07 16:46:36,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:46:36,156 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:36,157 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:46:36,157 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:36,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:36,157 INFO L82 PathProgramCache]: Analyzing trace with hash 260532153, now seen corresponding path program 1 times [2019-12-07 16:46:36,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:36,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033481802] [2019-12-07 16:46:36,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:46:36,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033481802] [2019-12-07 16:46:36,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:36,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:46:36,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825196261] [2019-12-07 16:46:36,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:36,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:36,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:36,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:36,214 INFO L87 Difference]: Start difference. First operand 66147 states and 104777 transitions. Second operand 3 states. [2019-12-07 16:46:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:37,522 INFO L93 Difference]: Finished difference Result 132339 states and 209617 transitions. [2019-12-07 16:46:37,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:37,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 16:46:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:37,605 INFO L225 Difference]: With dead ends: 132339 [2019-12-07 16:46:37,606 INFO L226 Difference]: Without dead ends: 66199 [2019-12-07 16:46:37,642 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 16:46:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66199 states. [2019-12-07 16:46:38,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66199 to 66197. [2019-12-07 16:46:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66197 states. [2019-12-07 16:46:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66197 states to 66197 states and 104827 transitions. [2019-12-07 16:46:38,440 INFO L78 Accepts]: Start accepts. Automaton has 66197 states and 104827 transitions. Word has length 42 [2019-12-07 16:46:38,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:38,440 INFO L462 AbstractCegarLoop]: Abstraction has 66197 states and 104827 transitions. [2019-12-07 16:46:38,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:46:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 66197 states and 104827 transitions. [2019-12-07 16:46:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 16:46:38,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:38,441 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:46:38,442 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:38,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:38,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1850197707, now seen corresponding path program 1 times [2019-12-07 16:46:38,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:38,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078472809] [2019-12-07 16:46:38,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:46:38,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078472809] [2019-12-07 16:46:38,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:38,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:46:38,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673218565] [2019-12-07 16:46:38,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:46:38,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:38,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:46:38,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:46:38,547 INFO L87 Difference]: Start difference. First operand 66197 states and 104827 transitions. Second operand 4 states. [2019-12-07 16:46:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:45,582 INFO L93 Difference]: Finished difference Result 126784 states and 200684 transitions. [2019-12-07 16:46:45,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:46:45,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-07 16:46:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:45,664 INFO L225 Difference]: With dead ends: 126784 [2019-12-07 16:46:45,664 INFO L226 Difference]: Without dead ends: 66491 [2019-12-07 16:46:45,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:46:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66491 states. [2019-12-07 16:46:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66491 to 63917. [2019-12-07 16:46:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63917 states. [2019-12-07 16:46:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63917 states to 63917 states and 99847 transitions. [2019-12-07 16:46:46,286 INFO L78 Accepts]: Start accepts. Automaton has 63917 states and 99847 transitions. Word has length 51 [2019-12-07 16:46:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:46,286 INFO L462 AbstractCegarLoop]: Abstraction has 63917 states and 99847 transitions. [2019-12-07 16:46:46,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:46:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 63917 states and 99847 transitions. [2019-12-07 16:46:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 16:46:46,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:46,287 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:46:46,288 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:46,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:46,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1545744311, now seen corresponding path program 1 times [2019-12-07 16:46:46,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:46,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642882267] [2019-12-07 16:46:46,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:46:46,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642882267] [2019-12-07 16:46:46,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:46,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:46:46,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019215894] [2019-12-07 16:46:46,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:46,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:46,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:46,346 INFO L87 Difference]: Start difference. First operand 63917 states and 99847 transitions. Second operand 3 states. [2019-12-07 16:46:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:47,552 INFO L93 Difference]: Finished difference Result 127889 states and 199777 transitions. [2019-12-07 16:46:47,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:47,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 16:46:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:47,623 INFO L225 Difference]: With dead ends: 127889 [2019-12-07 16:46:47,623 INFO L226 Difference]: Without dead ends: 63979 [2019-12-07 16:46:47,651 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 16:46:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63979 states. [2019-12-07 16:46:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63979 to 63977. [2019-12-07 16:46:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63977 states. [2019-12-07 16:46:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63977 states to 63977 states and 99907 transitions. [2019-12-07 16:46:48,215 INFO L78 Accepts]: Start accepts. Automaton has 63977 states and 99907 transitions. Word has length 52 [2019-12-07 16:46:48,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:48,216 INFO L462 AbstractCegarLoop]: Abstraction has 63977 states and 99907 transitions. [2019-12-07 16:46:48,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:46:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 63977 states and 99907 transitions. [2019-12-07 16:46:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 16:46:48,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:48,217 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:46:48,217 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:48,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:48,218 INFO L82 PathProgramCache]: Analyzing trace with hash -645596173, now seen corresponding path program 1 times [2019-12-07 16:46:48,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:48,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053892004] [2019-12-07 16:46:48,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:46:48,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053892004] [2019-12-07 16:46:48,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:48,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:46:48,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770514400] [2019-12-07 16:46:48,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:46:48,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:48,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:46:48,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:46:48,273 INFO L87 Difference]: Start difference. First operand 63977 states and 99907 transitions. Second operand 4 states. [2019-12-07 16:46:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:52,907 INFO L93 Difference]: Finished difference Result 116797 states and 181837 transitions. [2019-12-07 16:46:52,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:52,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 16:46:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:52,986 INFO L225 Difference]: With dead ends: 116797 [2019-12-07 16:46:52,986 INFO L226 Difference]: Without dead ends: 64987 [2019-12-07 16:46:53,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:46:53,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64987 states. [2019-12-07 16:46:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64987 to 63721. [2019-12-07 16:46:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63721 states. [2019-12-07 16:46:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63721 states to 63721 states and 98883 transitions. [2019-12-07 16:46:53,613 INFO L78 Accepts]: Start accepts. Automaton has 63721 states and 98883 transitions. Word has length 57 [2019-12-07 16:46:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:53,613 INFO L462 AbstractCegarLoop]: Abstraction has 63721 states and 98883 transitions. [2019-12-07 16:46:53,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:46:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 63721 states and 98883 transitions. [2019-12-07 16:46:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:46:53,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:53,614 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:46:53,614 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:53,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2088051592, now seen corresponding path program 1 times [2019-12-07 16:46:53,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:53,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380981994] [2019-12-07 16:46:53,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:46:53,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380981994] [2019-12-07 16:46:53,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:53,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:46:53,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571704808] [2019-12-07 16:46:53,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:53,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:53,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:53,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:53,663 INFO L87 Difference]: Start difference. First operand 63721 states and 98883 transitions. Second operand 3 states. [2019-12-07 16:46:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:57,678 INFO L93 Difference]: Finished difference Result 129849 states and 200363 transitions. [2019-12-07 16:46:57,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:46:57,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-07 16:46:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:57,751 INFO L225 Difference]: With dead ends: 129849 [2019-12-07 16:46:57,751 INFO L226 Difference]: Without dead ends: 66095 [2019-12-07 16:46:57,783 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 16:46:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66095 states. [2019-12-07 16:46:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66095 to 63401. [2019-12-07 16:46:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63401 states. [2019-12-07 16:46:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63401 states to 63401 states and 98163 transitions. [2019-12-07 16:46:58,329 INFO L78 Accepts]: Start accepts. Automaton has 63401 states and 98163 transitions. Word has length 63 [2019-12-07 16:46:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:58,330 INFO L462 AbstractCegarLoop]: Abstraction has 63401 states and 98163 transitions. [2019-12-07 16:46:58,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:46:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 63401 states and 98163 transitions. [2019-12-07 16:46:58,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 16:46:58,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:46:58,331 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:46:58,331 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:46:58,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:46:58,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1015894375, now seen corresponding path program 1 times [2019-12-07 16:46:58,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:46:58,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309165809] [2019-12-07 16:46:58,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:46:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:46:58,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:46:58,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309165809] [2019-12-07 16:46:58,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:46:58,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:46:58,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122483264] [2019-12-07 16:46:58,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:46:58,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:46:58,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:46:58,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:46:58,412 INFO L87 Difference]: Start difference. First operand 63401 states and 98163 transitions. Second operand 3 states. [2019-12-07 16:47:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:04,276 INFO L93 Difference]: Finished difference Result 103469 states and 158959 transitions. [2019-12-07 16:47:04,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:04,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 16:47:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:04,366 INFO L225 Difference]: With dead ends: 103469 [2019-12-07 16:47:04,366 INFO L226 Difference]: Without dead ends: 76819 [2019-12-07 16:47:04,389 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 16:47:04,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76819 states. [2019-12-07 16:47:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76819 to 74945. [2019-12-07 16:47:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74945 states. [2019-12-07 16:47:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74945 states to 74945 states and 116157 transitions. [2019-12-07 16:47:05,185 INFO L78 Accepts]: Start accepts. Automaton has 74945 states and 116157 transitions. Word has length 73 [2019-12-07 16:47:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:05,185 INFO L462 AbstractCegarLoop]: Abstraction has 74945 states and 116157 transitions. [2019-12-07 16:47:05,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 74945 states and 116157 transitions. [2019-12-07 16:47:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 16:47:05,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:05,186 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:47:05,187 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:05,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:05,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1346282361, now seen corresponding path program 1 times [2019-12-07 16:47:05,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:05,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169886293] [2019-12-07 16:47:05,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:47:05,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169886293] [2019-12-07 16:47:05,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:05,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:47:05,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215374683] [2019-12-07 16:47:05,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:47:05,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:05,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:47:05,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:47:05,234 INFO L87 Difference]: Start difference. First operand 74945 states and 116157 transitions. Second operand 3 states. [2019-12-07 16:47:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:06,304 INFO L93 Difference]: Finished difference Result 143370 states and 222218 transitions. [2019-12-07 16:47:06,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:06,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-07 16:47:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:06,380 INFO L225 Difference]: With dead ends: 143370 [2019-12-07 16:47:06,381 INFO L226 Difference]: Without dead ends: 68432 [2019-12-07 16:47:06,416 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 16:47:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68432 states. [2019-12-07 16:47:06,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68432 to 68430. [2019-12-07 16:47:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68430 states. [2019-12-07 16:47:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68430 states to 68430 states and 106020 transitions. [2019-12-07 16:47:07,006 INFO L78 Accepts]: Start accepts. Automaton has 68430 states and 106020 transitions. Word has length 80 [2019-12-07 16:47:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:07,006 INFO L462 AbstractCegarLoop]: Abstraction has 68430 states and 106020 transitions. [2019-12-07 16:47:07,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 68430 states and 106020 transitions. [2019-12-07 16:47:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 16:47:07,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:07,008 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:47:07,008 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:07,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:07,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1309827596, now seen corresponding path program 1 times [2019-12-07 16:47:07,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:07,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187376828] [2019-12-07 16:47:07,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:47:07,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187376828] [2019-12-07 16:47:07,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:07,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:47:07,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724610178] [2019-12-07 16:47:07,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:47:07,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:07,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:47:07,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:47:07,056 INFO L87 Difference]: Start difference. First operand 68430 states and 106020 transitions. Second operand 3 states. [2019-12-07 16:47:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:08,164 INFO L93 Difference]: Finished difference Result 136167 states and 210969 transitions. [2019-12-07 16:47:08,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:08,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 16:47:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:08,241 INFO L225 Difference]: With dead ends: 136167 [2019-12-07 16:47:08,242 INFO L226 Difference]: Without dead ends: 68528 [2019-12-07 16:47:08,274 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 16:47:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68528 states. [2019-12-07 16:47:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68528 to 68526. [2019-12-07 16:47:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68526 states. [2019-12-07 16:47:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68526 states to 68526 states and 106116 transitions. [2019-12-07 16:47:08,852 INFO L78 Accepts]: Start accepts. Automaton has 68526 states and 106116 transitions. Word has length 83 [2019-12-07 16:47:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:08,852 INFO L462 AbstractCegarLoop]: Abstraction has 68526 states and 106116 transitions. [2019-12-07 16:47:08,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 68526 states and 106116 transitions. [2019-12-07 16:47:08,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 16:47:08,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:08,854 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:47:08,854 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:08,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:08,855 INFO L82 PathProgramCache]: Analyzing trace with hash -557086491, now seen corresponding path program 1 times [2019-12-07 16:47:08,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:08,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240414104] [2019-12-07 16:47:08,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:47:08,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240414104] [2019-12-07 16:47:08,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:08,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:47:08,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002566999] [2019-12-07 16:47:08,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:47:08,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:47:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:47:08,966 INFO L87 Difference]: Start difference. First operand 68526 states and 106116 transitions. Second operand 4 states. [2019-12-07 16:47:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:14,435 INFO L93 Difference]: Finished difference Result 93508 states and 143767 transitions. [2019-12-07 16:47:14,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:47:14,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 16:47:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:14,481 INFO L225 Difference]: With dead ends: 93508 [2019-12-07 16:47:14,481 INFO L226 Difference]: Without dead ends: 47149 [2019-12-07 16:47:14,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:47:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47149 states. [2019-12-07 16:47:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47149 to 45904. [2019-12-07 16:47:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45904 states. [2019-12-07 16:47:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45904 states to 45904 states and 70581 transitions. [2019-12-07 16:47:14,867 INFO L78 Accepts]: Start accepts. Automaton has 45904 states and 70581 transitions. Word has length 87 [2019-12-07 16:47:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:14,867 INFO L462 AbstractCegarLoop]: Abstraction has 45904 states and 70581 transitions. [2019-12-07 16:47:14,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:47:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 45904 states and 70581 transitions. [2019-12-07 16:47:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 16:47:14,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:14,869 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:47:14,869 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:14,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1865533877, now seen corresponding path program 1 times [2019-12-07 16:47:14,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:14,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244081872] [2019-12-07 16:47:14,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:47:14,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244081872] [2019-12-07 16:47:14,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:14,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:47:14,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487210257] [2019-12-07 16:47:14,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:47:14,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:14,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:47:14,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:47:14,991 INFO L87 Difference]: Start difference. First operand 45904 states and 70581 transitions. Second operand 4 states. [2019-12-07 16:47:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:21,204 INFO L93 Difference]: Finished difference Result 59586 states and 90512 transitions. [2019-12-07 16:47:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:47:21,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 16:47:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:21,241 INFO L225 Difference]: With dead ends: 59586 [2019-12-07 16:47:21,242 INFO L226 Difference]: Without dead ends: 35849 [2019-12-07 16:47:21,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:47:21,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35849 states. [2019-12-07 16:47:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35849 to 34604. [2019-12-07 16:47:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34604 states. [2019-12-07 16:47:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34604 states to 34604 states and 52921 transitions. [2019-12-07 16:47:21,569 INFO L78 Accepts]: Start accepts. Automaton has 34604 states and 52921 transitions. Word has length 89 [2019-12-07 16:47:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:21,570 INFO L462 AbstractCegarLoop]: Abstraction has 34604 states and 52921 transitions. [2019-12-07 16:47:21,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:47:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 34604 states and 52921 transitions. [2019-12-07 16:47:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 16:47:21,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:21,572 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:47:21,572 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:21,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:21,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1292572411, now seen corresponding path program 1 times [2019-12-07 16:47:21,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:21,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143466864] [2019-12-07 16:47:21,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:47:21,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143466864] [2019-12-07 16:47:21,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:21,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:47:21,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801485656] [2019-12-07 16:47:21,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:47:21,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:21,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:47:21,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:47:21,622 INFO L87 Difference]: Start difference. First operand 34604 states and 52921 transitions. Second operand 3 states. [2019-12-07 16:47:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:22,537 INFO L93 Difference]: Finished difference Result 35777 states and 54652 transitions. [2019-12-07 16:47:22,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:22,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 16:47:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:22,572 INFO L225 Difference]: With dead ends: 35777 [2019-12-07 16:47:22,573 INFO L226 Difference]: Without dead ends: 35775 [2019-12-07 16:47:22,579 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 16:47:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35775 states. [2019-12-07 16:47:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35775 to 35769. [2019-12-07 16:47:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35769 states. [2019-12-07 16:47:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35769 states to 35769 states and 54634 transitions. [2019-12-07 16:47:22,878 INFO L78 Accepts]: Start accepts. Automaton has 35769 states and 54634 transitions. Word has length 97 [2019-12-07 16:47:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:22,879 INFO L462 AbstractCegarLoop]: Abstraction has 35769 states and 54634 transitions. [2019-12-07 16:47:22,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 35769 states and 54634 transitions. [2019-12-07 16:47:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 16:47:22,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:22,881 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:22,881 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:22,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1863744109, now seen corresponding path program 1 times [2019-12-07 16:47:22,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:22,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041991459] [2019-12-07 16:47:22,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:47:22,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041991459] [2019-12-07 16:47:22,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:22,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:47:22,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651740321] [2019-12-07 16:47:22,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:47:22,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:22,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:47:22,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:47:22,926 INFO L87 Difference]: Start difference. First operand 35769 states and 54634 transitions. Second operand 3 states. [2019-12-07 16:47:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:24,041 INFO L93 Difference]: Finished difference Result 60063 states and 91591 transitions. [2019-12-07 16:47:24,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:24,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 16:47:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:24,077 INFO L225 Difference]: With dead ends: 60063 [2019-12-07 16:47:24,077 INFO L226 Difference]: Without dead ends: 35465 [2019-12-07 16:47:24,091 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 16:47:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35465 states. [2019-12-07 16:47:24,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35465 to 35465. [2019-12-07 16:47:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2019-12-07 16:47:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 53872 transitions. [2019-12-07 16:47:24,426 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 53872 transitions. Word has length 98 [2019-12-07 16:47:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:24,426 INFO L462 AbstractCegarLoop]: Abstraction has 35465 states and 53872 transitions. [2019-12-07 16:47:24,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 53872 transitions. [2019-12-07 16:47:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 16:47:24,428 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:24,429 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:47:24,429 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:24,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:24,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2146571237, now seen corresponding path program 1 times [2019-12-07 16:47:24,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:24,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015427369] [2019-12-07 16:47:24,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:47:24,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015427369] [2019-12-07 16:47:24,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:24,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:47:24,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146816305] [2019-12-07 16:47:24,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:47:24,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:24,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:47:24,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:47:24,559 INFO L87 Difference]: Start difference. First operand 35465 states and 53872 transitions. Second operand 4 states. [2019-12-07 16:47:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:31,106 INFO L93 Difference]: Finished difference Result 42477 states and 64024 transitions. [2019-12-07 16:47:31,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:47:31,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-12-07 16:47:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:31,154 INFO L225 Difference]: With dead ends: 42477 [2019-12-07 16:47:31,154 INFO L226 Difference]: Without dead ends: 42405 [2019-12-07 16:47:31,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:47:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42405 states. [2019-12-07 16:47:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42405 to 41266. [2019-12-07 16:47:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41266 states. [2019-12-07 16:47:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41266 states to 41266 states and 62727 transitions. [2019-12-07 16:47:31,521 INFO L78 Accepts]: Start accepts. Automaton has 41266 states and 62727 transitions. Word has length 111 [2019-12-07 16:47:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:31,521 INFO L462 AbstractCegarLoop]: Abstraction has 41266 states and 62727 transitions. [2019-12-07 16:47:31,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:47:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 41266 states and 62727 transitions. [2019-12-07 16:47:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 16:47:31,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:31,523 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:47:31,523 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:31,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:31,523 INFO L82 PathProgramCache]: Analyzing trace with hash -756484602, now seen corresponding path program 1 times [2019-12-07 16:47:31,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:31,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374087916] [2019-12-07 16:47:31,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:47:31,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374087916] [2019-12-07 16:47:31,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:31,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:47:31,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003168720] [2019-12-07 16:47:31,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:47:31,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:31,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:47:31,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:47:31,572 INFO L87 Difference]: Start difference. First operand 41266 states and 62727 transitions. Second operand 3 states. [2019-12-07 16:47:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:32,373 INFO L93 Difference]: Finished difference Result 70592 states and 107044 transitions. [2019-12-07 16:47:32,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:32,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-12-07 16:47:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:32,405 INFO L225 Difference]: With dead ends: 70592 [2019-12-07 16:47:32,406 INFO L226 Difference]: Without dead ends: 31455 [2019-12-07 16:47:32,423 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 16:47:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31455 states. [2019-12-07 16:47:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31455 to 31453. [2019-12-07 16:47:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31453 states. [2019-12-07 16:47:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31453 states to 31453 states and 47428 transitions. [2019-12-07 16:47:32,692 INFO L78 Accepts]: Start accepts. Automaton has 31453 states and 47428 transitions. Word has length 113 [2019-12-07 16:47:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:32,693 INFO L462 AbstractCegarLoop]: Abstraction has 31453 states and 47428 transitions. [2019-12-07 16:47:32,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 31453 states and 47428 transitions. [2019-12-07 16:47:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 16:47:32,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:32,694 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:32,695 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:32,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:32,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1141324682, now seen corresponding path program 1 times [2019-12-07 16:47:32,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:32,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827134089] [2019-12-07 16:47:32,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:47:32,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827134089] [2019-12-07 16:47:32,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:32,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:47:32,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537336159] [2019-12-07 16:47:32,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:47:32,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:32,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:47:32,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:47:32,902 INFO L87 Difference]: Start difference. First operand 31453 states and 47428 transitions. Second operand 5 states. [2019-12-07 16:47:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:45,970 INFO L93 Difference]: Finished difference Result 46688 states and 68856 transitions. [2019-12-07 16:47:45,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:47:45,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-12-07 16:47:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:46,011 INFO L225 Difference]: With dead ends: 46688 [2019-12-07 16:47:46,011 INFO L226 Difference]: Without dead ends: 33799 [2019-12-07 16:47:46,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:47:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33799 states. [2019-12-07 16:47:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33799 to 25126. [2019-12-07 16:47:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25126 states. [2019-12-07 16:47:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25126 states to 25126 states and 37660 transitions. [2019-12-07 16:47:46,278 INFO L78 Accepts]: Start accepts. Automaton has 25126 states and 37660 transitions. Word has length 117 [2019-12-07 16:47:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:46,278 INFO L462 AbstractCegarLoop]: Abstraction has 25126 states and 37660 transitions. [2019-12-07 16:47:46,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:47:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 25126 states and 37660 transitions. [2019-12-07 16:47:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 16:47:46,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:46,280 INFO L410 BasicCegarLoop]: trace histogram [4, 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] [2019-12-07 16:47:46,280 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:46,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:46,281 INFO L82 PathProgramCache]: Analyzing trace with hash 573768167, now seen corresponding path program 1 times [2019-12-07 16:47:46,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:46,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308917551] [2019-12-07 16:47:46,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 16:47:46,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308917551] [2019-12-07 16:47:46,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:46,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:47:46,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705558408] [2019-12-07 16:47:46,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:47:46,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:46,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:47:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:47:46,338 INFO L87 Difference]: Start difference. First operand 25126 states and 37660 transitions. Second operand 3 states. [2019-12-07 16:47:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:46,963 INFO L93 Difference]: Finished difference Result 46627 states and 70012 transitions. [2019-12-07 16:47:46,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:46,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-12-07 16:47:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:46,985 INFO L225 Difference]: With dead ends: 46627 [2019-12-07 16:47:46,985 INFO L226 Difference]: Without dead ends: 23022 [2019-12-07 16:47:46,997 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 16:47:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23022 states. [2019-12-07 16:47:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23022 to 23020. [2019-12-07 16:47:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23020 states. [2019-12-07 16:47:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23020 states to 23020 states and 34509 transitions. [2019-12-07 16:47:47,181 INFO L78 Accepts]: Start accepts. Automaton has 23020 states and 34509 transitions. Word has length 135 [2019-12-07 16:47:47,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:47,182 INFO L462 AbstractCegarLoop]: Abstraction has 23020 states and 34509 transitions. [2019-12-07 16:47:47,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 23020 states and 34509 transitions. [2019-12-07 16:47:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 16:47:47,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:47,184 INFO L410 BasicCegarLoop]: trace histogram [4, 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] [2019-12-07 16:47:47,184 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:47,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:47,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1953273572, now seen corresponding path program 1 times [2019-12-07 16:47:47,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:47,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418380258] [2019-12-07 16:47:47,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 16:47:47,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418380258] [2019-12-07 16:47:47,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:47,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:47:47,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103354442] [2019-12-07 16:47:47,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:47:47,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:47:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:47:47,238 INFO L87 Difference]: Start difference. First operand 23020 states and 34509 transitions. Second operand 3 states. [2019-12-07 16:47:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:47,887 INFO L93 Difference]: Finished difference Result 39200 states and 58797 transitions. [2019-12-07 16:47:47,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:47,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-12-07 16:47:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:47,905 INFO L225 Difference]: With dead ends: 39200 [2019-12-07 16:47:47,905 INFO L226 Difference]: Without dead ends: 18275 [2019-12-07 16:47:47,915 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 16:47:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18275 states. [2019-12-07 16:47:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18275 to 18273. [2019-12-07 16:47:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18273 states. [2019-12-07 16:47:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18273 states to 18273 states and 27277 transitions. [2019-12-07 16:47:48,060 INFO L78 Accepts]: Start accepts. Automaton has 18273 states and 27277 transitions. Word has length 137 [2019-12-07 16:47:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:48,060 INFO L462 AbstractCegarLoop]: Abstraction has 18273 states and 27277 transitions. [2019-12-07 16:47:48,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 18273 states and 27277 transitions. [2019-12-07 16:47:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 16:47:48,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:48,062 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:47:48,062 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:48,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:48,062 INFO L82 PathProgramCache]: Analyzing trace with hash 291554910, now seen corresponding path program 1 times [2019-12-07 16:47:48,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:48,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401128731] [2019-12-07 16:47:48,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:47:48,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401128731] [2019-12-07 16:47:48,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:48,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:47:48,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307766043] [2019-12-07 16:47:48,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:47:48,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:48,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:47:48,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:47:48,190 INFO L87 Difference]: Start difference. First operand 18273 states and 27277 transitions. Second operand 4 states. [2019-12-07 16:47:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:50,506 INFO L93 Difference]: Finished difference Result 18283 states and 27285 transitions. [2019-12-07 16:47:50,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:47:50,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-12-07 16:47:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:50,529 INFO L225 Difference]: With dead ends: 18283 [2019-12-07 16:47:50,530 INFO L226 Difference]: Without dead ends: 18213 [2019-12-07 16:47:50,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:47:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18213 states. [2019-12-07 16:47:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18213 to 12891. [2019-12-07 16:47:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12891 states. [2019-12-07 16:47:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12891 states to 12891 states and 18969 transitions. [2019-12-07 16:47:50,654 INFO L78 Accepts]: Start accepts. Automaton has 12891 states and 18969 transitions. Word has length 141 [2019-12-07 16:47:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:50,654 INFO L462 AbstractCegarLoop]: Abstraction has 12891 states and 18969 transitions. [2019-12-07 16:47:50,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:47:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 12891 states and 18969 transitions. [2019-12-07 16:47:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 16:47:50,656 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:50,656 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:50,656 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:50,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:50,657 INFO L82 PathProgramCache]: Analyzing trace with hash 372632353, now seen corresponding path program 1 times [2019-12-07 16:47:50,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:50,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581504733] [2019-12-07 16:47:50,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 16:47:50,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581504733] [2019-12-07 16:47:50,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:50,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:47:50,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399023760] [2019-12-07 16:47:50,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:47:50,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:50,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:47:50,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:47:50,713 INFO L87 Difference]: Start difference. First operand 12891 states and 18969 transitions. Second operand 3 states. [2019-12-07 16:47:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:51,884 INFO L93 Difference]: Finished difference Result 23237 states and 34276 transitions. [2019-12-07 16:47:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:51,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-12-07 16:47:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:51,900 INFO L225 Difference]: With dead ends: 23237 [2019-12-07 16:47:51,901 INFO L226 Difference]: Without dead ends: 12258 [2019-12-07 16:47:51,907 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 16:47:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12258 states. [2019-12-07 16:47:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12258 to 12256. [2019-12-07 16:47:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12256 states. [2019-12-07 16:47:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12256 states to 12256 states and 18019 transitions. [2019-12-07 16:47:52,004 INFO L78 Accepts]: Start accepts. Automaton has 12256 states and 18019 transitions. Word has length 143 [2019-12-07 16:47:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:52,004 INFO L462 AbstractCegarLoop]: Abstraction has 12256 states and 18019 transitions. [2019-12-07 16:47:52,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 12256 states and 18019 transitions. [2019-12-07 16:47:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 16:47:52,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:52,006 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:52,007 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:52,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:52,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1357924710, now seen corresponding path program 1 times [2019-12-07 16:47:52,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:52,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891126725] [2019-12-07 16:47:52,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 16:47:52,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891126725] [2019-12-07 16:47:52,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:52,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:47:52,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020717325] [2019-12-07 16:47:52,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:47:52,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:52,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:47:52,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:47:52,062 INFO L87 Difference]: Start difference. First operand 12256 states and 18019 transitions. Second operand 3 states. [2019-12-07 16:47:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:52,662 INFO L93 Difference]: Finished difference Result 22632 states and 33350 transitions. [2019-12-07 16:47:52,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:52,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-12-07 16:47:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:52,672 INFO L225 Difference]: With dead ends: 22632 [2019-12-07 16:47:52,672 INFO L226 Difference]: Without dead ends: 12288 [2019-12-07 16:47:52,677 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 16:47:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12288 states. [2019-12-07 16:47:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12288 to 12286. [2019-12-07 16:47:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12286 states. [2019-12-07 16:47:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12286 states to 12286 states and 18049 transitions. [2019-12-07 16:47:52,779 INFO L78 Accepts]: Start accepts. Automaton has 12286 states and 18049 transitions. Word has length 147 [2019-12-07 16:47:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:52,779 INFO L462 AbstractCegarLoop]: Abstraction has 12286 states and 18049 transitions. [2019-12-07 16:47:52,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 12286 states and 18049 transitions. [2019-12-07 16:47:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-07 16:47:52,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:52,782 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 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 16:47:52,782 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:52,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:52,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1695360865, now seen corresponding path program 1 times [2019-12-07 16:47:52,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:52,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902571473] [2019-12-07 16:47:52,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 16:47:52,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902571473] [2019-12-07 16:47:52,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:52,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:47:52,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70056804] [2019-12-07 16:47:52,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:47:52,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:52,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:47:52,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:47:52,846 INFO L87 Difference]: Start difference. First operand 12286 states and 18049 transitions. Second operand 3 states. [2019-12-07 16:47:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:53,359 INFO L93 Difference]: Finished difference Result 20360 states and 29990 transitions. [2019-12-07 16:47:53,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:53,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-12-07 16:47:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:53,366 INFO L225 Difference]: With dead ends: 20360 [2019-12-07 16:47:53,366 INFO L226 Difference]: Without dead ends: 9986 [2019-12-07 16:47:53,371 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 16:47:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states. [2019-12-07 16:47:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 9984. [2019-12-07 16:47:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9984 states. [2019-12-07 16:47:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9984 states to 9984 states and 14651 transitions. [2019-12-07 16:47:53,441 INFO L78 Accepts]: Start accepts. Automaton has 9984 states and 14651 transitions. Word has length 177 [2019-12-07 16:47:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:53,441 INFO L462 AbstractCegarLoop]: Abstraction has 9984 states and 14651 transitions. [2019-12-07 16:47:53,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 9984 states and 14651 transitions. [2019-12-07 16:47:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-12-07 16:47:53,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:53,444 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 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 16:47:53,444 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:53,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:53,444 INFO L82 PathProgramCache]: Analyzing trace with hash 781182402, now seen corresponding path program 1 times [2019-12-07 16:47:53,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:53,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424328326] [2019-12-07 16:47:53,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 16:47:53,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424328326] [2019-12-07 16:47:53,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:53,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:47:53,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308392223] [2019-12-07 16:47:53,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:47:53,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:53,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:47:53,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:47:53,517 INFO L87 Difference]: Start difference. First operand 9984 states and 14651 transitions. Second operand 3 states. [2019-12-07 16:47:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:53,726 INFO L93 Difference]: Finished difference Result 10386 states and 15212 transitions. [2019-12-07 16:47:53,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:47:53,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-12-07 16:47:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:53,729 INFO L225 Difference]: With dead ends: 10386 [2019-12-07 16:47:53,729 INFO L226 Difference]: Without dead ends: 2320 [2019-12-07 16:47:53,732 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 16:47:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2019-12-07 16:47:53,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2318. [2019-12-07 16:47:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-12-07 16:47:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3286 transitions. [2019-12-07 16:47:53,746 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3286 transitions. Word has length 182 [2019-12-07 16:47:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:53,746 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 3286 transitions. [2019-12-07 16:47:53,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:47:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3286 transitions. [2019-12-07 16:47:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-07 16:47:53,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:53,749 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:53,749 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1019673503, now seen corresponding path program 1 times [2019-12-07 16:47:53,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:53,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208632569] [2019-12-07 16:47:53,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:47:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:47:53,973 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:47:53,973 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:47:54,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:47:54 BoogieIcfgContainer [2019-12-07 16:47:54,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:47:54,093 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:47:54,093 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:47:54,093 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:47:54,094 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:46:07" (3/4) ... [2019-12-07 16:47:54,095 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:47:54,199 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_41cf278b-ac11-4fe8-8cb3-ec01377fb16f/bin/utaipan/witness.graphml [2019-12-07 16:47:54,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:47:54,200 INFO L168 Benchmark]: Toolchain (without parser) took 121504.46 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 883.3 MB in the beginning and 4.3 GB in the end (delta: -3.5 GB). Peak memory consumption was 896.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:47:54,201 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:47:54,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1942.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 883.3 MB in the beginning and 907.3 MB in the end (delta: -24.0 MB). Peak memory consumption was 430.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:47:54,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 372.24 ms. Allocated memory is still 1.2 GB. Free memory was 907.3 MB in the beginning and 750.0 MB in the end (delta: 157.3 MB). Peak memory consumption was 157.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:47:54,201 INFO L168 Benchmark]: Boogie Preprocessor took 704.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 750.0 MB in the beginning and 1.1 GB in the end (delta: -368.9 MB). Peak memory consumption was 276.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:47:54,202 INFO L168 Benchmark]: RCFGBuilder took 11565.40 ms. Allocated memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: 852.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -394.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 16:47:54,202 INFO L168 Benchmark]: TraceAbstraction took 106809.35 ms. Allocated memory was 2.3 GB in the beginning and 5.4 GB in the end (delta: 3.1 GB). Free memory was 1.5 GB in the beginning and 4.4 GB in the end (delta: -2.8 GB). Peak memory consumption was 256.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:47:54,202 INFO L168 Benchmark]: Witness Printer took 105.74 ms. Allocated memory is still 5.4 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:47:54,204 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1942.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 883.3 MB in the beginning and 907.3 MB in the end (delta: -24.0 MB). Peak memory consumption was 430.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 372.24 ms. Allocated memory is still 1.2 GB. Free memory was 907.3 MB in the beginning and 750.0 MB in the end (delta: 157.3 MB). Peak memory consumption was 157.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 704.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 750.0 MB in the beginning and 1.1 GB in the end (delta: -368.9 MB). Peak memory consumption was 276.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 11565.40 ms. Allocated memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: 852.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -394.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * TraceAbstraction took 106809.35 ms. Allocated memory was 2.3 GB in the beginning and 5.4 GB in the end (delta: 3.1 GB). Free memory was 1.5 GB in the beginning and 4.4 GB in the end (delta: -2.8 GB). Peak memory consumption was 256.4 MB. Max. memory is 11.5 GB. * Witness Printer took 105.74 ms. Allocated memory is still 5.4 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 49138]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_getInetAddress = 1; [L6] int m_getOOBInline = 2; [L7] int m_getLocalPort = 3; [L8] int m_isInputShutdown = 4; [L9] int m_setTcpNoDelay = 5; [L10] int m_isConnected = 6; [L11] int m_getKeepAlive = 7; [L12] int m_getLocalAddress = 8; [L13] int m_bind = 9; [L14] int m_getChannel = 10; [L15] int m_getSoLinger = 11; [L16] int m_getImpl = 12; [L17] int m_getTcpNoDelay = 13; [L18] int m_getSoTimeout = 14; [L19] int m_isOutputShutdown = 15; [L20] int m_postAccept = 16; [L21] int m_close = 17; [L22] int m_setOOBInline = 18; [L23] int m_getLocalSocketAddress = 19; [L24] int m_getReceiveBufferSize = 20; [L25] int m_setReuseAddress = 21; [L26] int m_getTrafficClass = 22; [L27] int m_getReuseAddress = 23; [L28] int m_createImpl = 24; [L29] int m_setCreated = 25; [L30] int m_setKeepAlive = 26; [L31] int m_getInputStream = 27; [L32] int m_shutdownOutput = 28; [L33] int m_shutdownInput = 29; [L34] int m_setPerformancePreferences = 30; [L35] int m_getPort = 31; [L36] int m_sendUrgentData = 32; [L37] int m_isClosed = 33; [L38] int m_isBound = 34; [L39] int m_setBound = 35; [L40] int m_getSendBufferSize = 36; [L41] int m_getOutputStream = 37; [L42] int m_setConnected = 38; [L43] int m_Socket = 39; [L44] int m_getRemoteSocketAddress = 40; [L45] int m_setReceiveBufferSize_1 = 41; [L46] int m_setReceiveBufferSize_2 = 42; [L47] int m_connect2_1 = 43; [L48] int m_connect2_2 = 44; [L49] int m_setSoLinger_1 = 45; [L50] int m_setSoLinger_2 = 46; [L51] int m_connect1_1 = 47; [L52] int m_connect1_2 = 48; [L53] int m_setTrafficClass_1 = 49; [L54] int m_setTrafficClass_2 = 50; [L55] int m_setSoTimeout_1 = 51; [L56] int m_setSoTimeout_2 = 52; [L57] int m_setSendBufferSize_1 = 53; [L58] int m_setSendBufferSize_2 = 54; [L59] int m_setSocketImplFactory_1 = 55; [L60] int m_setSocketImplFactory_2 = 56; [L65] int q = 0; [L66] int method_id; [L69] int this_oldImpl = 0; [L70] int this_factory = 0; [L71] int this_shutOut = 0; [L72] int this_created = 0; [L73] int this_shutIn = 0; [L74] int this_closed = 0; [L75] int this_bound = 0; [L76] int this_impl = 1; [L77] int this_connected = 0; VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND TRUE q == 0 [L117] COND TRUE __VERIFIER_nondet_int() [L121] method_id = 39 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L123] COND FALSE !(0) [L127] q = 2 [L129] this_factory=0 [L129] this_shutIn=0 [L129] this_connected=0 [L129] this_closed=0 [L129] this_shutOut=0 [L129] this_created=0 [L129] this_impl=1 [L129] this_bound=0 [L129] this_oldImpl=0 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND FALSE !(__VERIFIER_nondet_int()) [L2077] COND TRUE __VERIFIER_nondet_int() [L2079] COND TRUE !(P1 != 0) [L2081] method_id = 56 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L2083] COND FALSE !(((this_factory != 0) && !(P30 != 0))) [L2087] q = 2 [L2089] this_factory=P30 [L2089] this_shutIn=this_shutIn [L2089] this_connected=this_connected [L2089] this_closed=this_closed [L2089] this_shutOut=this_shutOut [L2089] this_created=this_created [L2089] this_impl=this_impl [L2089] this_bound=this_bound [L2089] this_oldImpl=this_oldImpl VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND TRUE __VERIFIER_nondet_int() [L2063] COND TRUE (P1 != 0) [L2065] method_id = 55 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L2067] COND TRUE ((this_factory != 0) && (P29 != 0)) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L49138] __VERIFIER_error() VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9209 locations, 1 error locations. Result: UNSAFE, OverallTime: 106.6s, OverallIterations: 32, TraceHistogramMax: 4, AutomataDifference: 93.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 364034 SDtfs, 259404 SDslu, 237921 SDs, 0 SdLazy, 73812 SolverSat, 25238 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74945occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 32214 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2645 NumberOfCodeBlocks, 2645 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2427 ConstructedInterpolants, 0 QuantifiedInterpolants, 1280189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 303/303 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...