./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_net_1_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_net_1_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/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.23-635dfa2 [2018-12-02 06:30:59,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:30:59,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:30:59,306 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:30:59,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:30:59,307 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:30:59,308 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:30:59,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:30:59,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:30:59,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:30:59,312 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:30:59,312 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:30:59,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:30:59,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:30:59,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:30:59,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:30:59,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:30:59,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:30:59,318 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:30:59,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:30:59,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:30:59,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:30:59,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:30:59,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:30:59,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:30:59,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:30:59,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:30:59,324 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:30:59,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:30:59,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:30:59,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:30:59,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:30:59,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:30:59,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:30:59,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:30:59,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:30:59,327 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 06:30:59,335 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:30:59,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:30:59,336 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 06:30:59,336 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 06:30:59,337 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 06:30:59,337 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 06:30:59,337 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 06:30:59,337 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 06:30:59,337 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 06:30:59,337 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 06:30:59,338 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 06:30:59,338 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 06:30:59,338 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 06:30:59,338 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:30:59,339 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:30:59,339 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:30:59,339 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:30:59,339 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:30:59,339 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 06:30:59,339 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 06:30:59,340 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 06:30:59,340 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:30:59,340 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:30:59,340 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 06:30:59,340 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:30:59,340 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:30:59,340 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 06:30:59,340 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 06:30:59,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 06:30:59,341 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:30:59,341 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 06:30:59,341 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 06:30:59,341 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 06:30:59,341 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 06:30:59,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 06:30:59,341 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 06:30:59,342 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/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 [2018-12-02 06:30:59,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:30:59,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:30:59,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:30:59,378 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:30:59,379 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:30:59,379 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/utaipan/../../sv-benchmarks/c/psyco/psyco_net_1_false-unreach-call_false-termination.c [2018-12-02 06:30:59,420 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/utaipan/data/71b0e90d7/a62341b0957242759c22cb616a2f8df0/FLAGfe44de786 [2018-12-02 06:31:00,080 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:31:00,080 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/sv-benchmarks/c/psyco/psyco_net_1_false-unreach-call_false-termination.c [2018-12-02 06:31:00,134 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/utaipan/data/71b0e90d7/a62341b0957242759c22cb616a2f8df0/FLAGfe44de786 [2018-12-02 06:31:00,403 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/utaipan/data/71b0e90d7/a62341b0957242759c22cb616a2f8df0 [2018-12-02 06:31:00,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:31:00,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:31:00,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:31:00,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:31:00,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:31:00,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:31:00" (1/1) ... [2018-12-02 06:31:00,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b0ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00, skipping insertion in model container [2018-12-02 06:31:00,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:31:00" (1/1) ... [2018-12-02 06:31:00,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:31:00,707 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:31:01,519 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:31:01,523 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:31:02,175 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:31:02,185 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:31:02,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02 WrapperNode [2018-12-02 06:31:02,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:31:02,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:31:02,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:31:02,186 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:31:02,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02" (1/1) ... [2018-12-02 06:31:02,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02" (1/1) ... [2018-12-02 06:31:02,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:31:02,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:31:02,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:31:02,271 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:31:02,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02" (1/1) ... [2018-12-02 06:31:02,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02" (1/1) ... [2018-12-02 06:31:02,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02" (1/1) ... [2018-12-02 06:31:02,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02" (1/1) ... [2018-12-02 06:31:02,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02" (1/1) ... [2018-12-02 06:31:02,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02" (1/1) ... [2018-12-02 06:31:02,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02" (1/1) ... [2018-12-02 06:31:02,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:31:02,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:31:02,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:31:02,808 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:31:02,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/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 [2018-12-02 06:31:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 06:31:02,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 06:31:02,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:31:02,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:31:02,841 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 06:31:02,841 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 06:31:12,136 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:31:12,136 INFO L280 CfgBuilder]: Removed 1130 assue(true) statements. [2018-12-02 06:31:12,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:31:12 BoogieIcfgContainer [2018-12-02 06:31:12,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:31:12,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 06:31:12,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 06:31:12,140 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 06:31:12,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:31:00" (1/3) ... [2018-12-02 06:31:12,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af99a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:31:12, skipping insertion in model container [2018-12-02 06:31:12,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:02" (2/3) ... [2018-12-02 06:31:12,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af99a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:31:12, skipping insertion in model container [2018-12-02 06:31:12,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:31:12" (3/3) ... [2018-12-02 06:31:12,143 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_net_1_false-unreach-call_false-termination.c [2018-12-02 06:31:12,153 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 06:31:12,165 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 06:31:12,177 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 06:31:12,211 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 06:31:12,211 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 06:31:12,212 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 06:31:12,212 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:31:12,212 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:31:12,212 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 06:31:12,212 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:31:12,212 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 06:31:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states. [2018-12-02 06:31:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 06:31:12,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:12,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:31:12,273 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:12,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:12,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2089661630, now seen corresponding path program 1 times [2018-12-02 06:31:12,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:12,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:12,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:12,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:12,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:12,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:12,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 06:31:12,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:12,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 06:31:12,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 06:31:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 06:31:12,418 INFO L87 Difference]: Start difference. First operand 9216 states. Second operand 2 states. [2018-12-02 06:31:12,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:12,554 INFO L93 Difference]: Finished difference Result 17704 states and 35386 transitions. [2018-12-02 06:31:12,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 06:31:12,555 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-12-02 06:31:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:12,582 INFO L225 Difference]: With dead ends: 17704 [2018-12-02 06:31:12,582 INFO L226 Difference]: Without dead ends: 8284 [2018-12-02 06:31:12,594 INFO L631 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 [2018-12-02 06:31:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2018-12-02 06:31:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284. [2018-12-02 06:31:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8284 states. [2018-12-02 06:31:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 13001 transitions. [2018-12-02 06:31:12,796 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 13001 transitions. Word has length 13 [2018-12-02 06:31:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:12,796 INFO L480 AbstractCegarLoop]: Abstraction has 8284 states and 13001 transitions. [2018-12-02 06:31:12,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 06:31:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 13001 transitions. [2018-12-02 06:31:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 06:31:12,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:12,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:31:12,797 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:12,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash 886062589, now seen corresponding path program 1 times [2018-12-02 06:31:12,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:12,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:12,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:12,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:12,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:12,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:12,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:12,843 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:12,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:12,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:12,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:12,845 INFO L87 Difference]: Start difference. First operand 8284 states and 13001 transitions. Second operand 3 states. [2018-12-02 06:31:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:14,039 INFO L93 Difference]: Finished difference Result 16565 states and 26000 transitions. [2018-12-02 06:31:14,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:14,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 06:31:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:14,055 INFO L225 Difference]: With dead ends: 16565 [2018-12-02 06:31:14,055 INFO L226 Difference]: Without dead ends: 8287 [2018-12-02 06:31:14,065 INFO L631 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 [2018-12-02 06:31:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2018-12-02 06:31:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 8287. [2018-12-02 06:31:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8287 states. [2018-12-02 06:31:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 13004 transitions. [2018-12-02 06:31:14,156 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 13004 transitions. Word has length 14 [2018-12-02 06:31:14,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:14,156 INFO L480 AbstractCegarLoop]: Abstraction has 8287 states and 13004 transitions. [2018-12-02 06:31:14,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:14,156 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 13004 transitions. [2018-12-02 06:31:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 06:31:14,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:14,157 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:31:14,157 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:14,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:14,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1585116607, now seen corresponding path program 1 times [2018-12-02 06:31:14,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:14,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:14,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:14,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:14,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:14,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:14,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:14,194 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:14,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:14,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:14,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:14,194 INFO L87 Difference]: Start difference. First operand 8287 states and 13004 transitions. Second operand 3 states. [2018-12-02 06:31:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:15,151 INFO L93 Difference]: Finished difference Result 16460 states and 25849 transitions. [2018-12-02 06:31:15,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:15,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 06:31:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:15,168 INFO L225 Difference]: With dead ends: 16460 [2018-12-02 06:31:15,168 INFO L226 Difference]: Without dead ends: 8180 [2018-12-02 06:31:15,177 INFO L631 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 [2018-12-02 06:31:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2018-12-02 06:31:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 8180. [2018-12-02 06:31:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2018-12-02 06:31:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 12850 transitions. [2018-12-02 06:31:15,261 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 12850 transitions. Word has length 19 [2018-12-02 06:31:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:15,262 INFO L480 AbstractCegarLoop]: Abstraction has 8180 states and 12850 transitions. [2018-12-02 06:31:15,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 12850 transitions. [2018-12-02 06:31:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 06:31:15,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:15,263 INFO L402 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] [2018-12-02 06:31:15,263 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:15,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:15,263 INFO L82 PathProgramCache]: Analyzing trace with hash -90884306, now seen corresponding path program 1 times [2018-12-02 06:31:15,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:15,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:15,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:15,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:15,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:15,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:15,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:15,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:15,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:15,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:15,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:15,301 INFO L87 Difference]: Start difference. First operand 8180 states and 12850 transitions. Second operand 3 states. [2018-12-02 06:31:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:17,254 INFO L93 Difference]: Finished difference Result 16268 states and 25567 transitions. [2018-12-02 06:31:17,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:17,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 06:31:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:17,269 INFO L225 Difference]: With dead ends: 16268 [2018-12-02 06:31:17,269 INFO L226 Difference]: Without dead ends: 8060 [2018-12-02 06:31:17,277 INFO L631 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 [2018-12-02 06:31:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8060 states. [2018-12-02 06:31:17,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8060 to 8060. [2018-12-02 06:31:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8060 states. [2018-12-02 06:31:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8060 states to 8060 states and 12230 transitions. [2018-12-02 06:31:17,363 INFO L78 Accepts]: Start accepts. Automaton has 8060 states and 12230 transitions. Word has length 23 [2018-12-02 06:31:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:17,363 INFO L480 AbstractCegarLoop]: Abstraction has 8060 states and 12230 transitions. [2018-12-02 06:31:17,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 8060 states and 12230 transitions. [2018-12-02 06:31:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 06:31:17,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:17,364 INFO L402 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] [2018-12-02 06:31:17,364 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:17,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:17,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2991053, now seen corresponding path program 1 times [2018-12-02 06:31:17,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:17,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:17,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:17,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:17,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:17,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:17,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:17,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:17,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:17,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:17,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:17,389 INFO L87 Difference]: Start difference. First operand 8060 states and 12230 transitions. Second operand 3 states. [2018-12-02 06:31:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:18,266 INFO L93 Difference]: Finished difference Result 16114 states and 24453 transitions. [2018-12-02 06:31:18,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:18,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 06:31:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:18,277 INFO L225 Difference]: With dead ends: 16114 [2018-12-02 06:31:18,277 INFO L226 Difference]: Without dead ends: 8066 [2018-12-02 06:31:18,285 INFO L631 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 [2018-12-02 06:31:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8066 states. [2018-12-02 06:31:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8066 to 8064. [2018-12-02 06:31:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8064 states. [2018-12-02 06:31:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8064 states to 8064 states and 12234 transitions. [2018-12-02 06:31:18,352 INFO L78 Accepts]: Start accepts. Automaton has 8064 states and 12234 transitions. Word has length 26 [2018-12-02 06:31:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:18,353 INFO L480 AbstractCegarLoop]: Abstraction has 8064 states and 12234 transitions. [2018-12-02 06:31:18,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 8064 states and 12234 transitions. [2018-12-02 06:31:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 06:31:18,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:18,354 INFO L402 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] [2018-12-02 06:31:18,354 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:18,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1847963214, now seen corresponding path program 1 times [2018-12-02 06:31:18,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:18,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:18,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:18,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:18,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:18,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:18,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:18,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:18,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:18,385 INFO L87 Difference]: Start difference. First operand 8064 states and 12234 transitions. Second operand 3 states. [2018-12-02 06:31:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:20,442 INFO L93 Difference]: Finished difference Result 24168 states and 36676 transitions. [2018-12-02 06:31:20,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:20,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 06:31:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:20,463 INFO L225 Difference]: With dead ends: 24168 [2018-12-02 06:31:20,464 INFO L226 Difference]: Without dead ends: 16068 [2018-12-02 06:31:20,472 INFO L631 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 [2018-12-02 06:31:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16068 states. [2018-12-02 06:31:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16068 to 14810. [2018-12-02 06:31:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14810 states. [2018-12-02 06:31:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14810 states to 14810 states and 23046 transitions. [2018-12-02 06:31:20,611 INFO L78 Accepts]: Start accepts. Automaton has 14810 states and 23046 transitions. Word has length 27 [2018-12-02 06:31:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:20,611 INFO L480 AbstractCegarLoop]: Abstraction has 14810 states and 23046 transitions. [2018-12-02 06:31:20,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 14810 states and 23046 transitions. [2018-12-02 06:31:20,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 06:31:20,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:20,611 INFO L402 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] [2018-12-02 06:31:20,612 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:20,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:20,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1901804161, now seen corresponding path program 1 times [2018-12-02 06:31:20,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:20,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:20,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:20,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:20,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:20,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:20,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:20,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:20,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:20,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:20,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:20,642 INFO L87 Difference]: Start difference. First operand 14810 states and 23046 transitions. Second operand 3 states. [2018-12-02 06:31:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:26,724 INFO L93 Difference]: Finished difference Result 37340 states and 57908 transitions. [2018-12-02 06:31:26,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:26,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 06:31:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:26,754 INFO L225 Difference]: With dead ends: 37340 [2018-12-02 06:31:26,754 INFO L226 Difference]: Without dead ends: 22270 [2018-12-02 06:31:26,768 INFO L631 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 [2018-12-02 06:31:26,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22270 states. [2018-12-02 06:31:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22270 to 21076. [2018-12-02 06:31:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21076 states. [2018-12-02 06:31:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21076 states to 21076 states and 32688 transitions. [2018-12-02 06:31:26,948 INFO L78 Accepts]: Start accepts. Automaton has 21076 states and 32688 transitions. Word has length 29 [2018-12-02 06:31:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:26,948 INFO L480 AbstractCegarLoop]: Abstraction has 21076 states and 32688 transitions. [2018-12-02 06:31:26,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 21076 states and 32688 transitions. [2018-12-02 06:31:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 06:31:26,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:26,949 INFO L402 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] [2018-12-02 06:31:26,949 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:26,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:26,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1134426699, now seen corresponding path program 1 times [2018-12-02 06:31:26,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:26,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:26,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:26,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:26,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:26,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:26,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:26,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:26,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:26,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:26,982 INFO L87 Difference]: Start difference. First operand 21076 states and 32688 transitions. Second operand 3 states. [2018-12-02 06:31:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:31,355 INFO L93 Difference]: Finished difference Result 63174 states and 97978 transitions. [2018-12-02 06:31:31,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:31,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-02 06:31:31,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:31,416 INFO L225 Difference]: With dead ends: 63174 [2018-12-02 06:31:31,416 INFO L226 Difference]: Without dead ends: 42110 [2018-12-02 06:31:31,432 INFO L631 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 [2018-12-02 06:31:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42110 states. [2018-12-02 06:31:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42110 to 40084. [2018-12-02 06:31:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40084 states. [2018-12-02 06:31:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40084 states to 40084 states and 63062 transitions. [2018-12-02 06:31:31,764 INFO L78 Accepts]: Start accepts. Automaton has 40084 states and 63062 transitions. Word has length 34 [2018-12-02 06:31:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:31,764 INFO L480 AbstractCegarLoop]: Abstraction has 40084 states and 63062 transitions. [2018-12-02 06:31:31,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 40084 states and 63062 transitions. [2018-12-02 06:31:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 06:31:31,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:31,765 INFO L402 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] [2018-12-02 06:31:31,765 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:31,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:31,766 INFO L82 PathProgramCache]: Analyzing trace with hash -435466128, now seen corresponding path program 1 times [2018-12-02 06:31:31,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:31,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:31,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:31,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:31,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:31,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:31,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:31,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:31,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:31,795 INFO L87 Difference]: Start difference. First operand 40084 states and 63062 transitions. Second operand 3 states. [2018-12-02 06:31:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:34,897 INFO L93 Difference]: Finished difference Result 107946 states and 170048 transitions. [2018-12-02 06:31:34,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:34,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-02 06:31:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:34,971 INFO L225 Difference]: With dead ends: 107946 [2018-12-02 06:31:34,972 INFO L226 Difference]: Without dead ends: 67826 [2018-12-02 06:31:35,006 INFO L631 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 [2018-12-02 06:31:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67826 states. [2018-12-02 06:31:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67826 to 66152. [2018-12-02 06:31:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66152 states. [2018-12-02 06:31:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66152 states to 66152 states and 104782 transitions. [2018-12-02 06:31:35,602 INFO L78 Accepts]: Start accepts. Automaton has 66152 states and 104782 transitions. Word has length 43 [2018-12-02 06:31:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:35,602 INFO L480 AbstractCegarLoop]: Abstraction has 66152 states and 104782 transitions. [2018-12-02 06:31:35,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 66152 states and 104782 transitions. [2018-12-02 06:31:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 06:31:35,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:35,603 INFO L402 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] [2018-12-02 06:31:35,603 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:35,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1631732678, now seen corresponding path program 1 times [2018-12-02 06:31:35,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:35,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:35,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:35,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:35,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 06:31:35,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:35,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:35,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:35,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:35,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:35,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:35,641 INFO L87 Difference]: Start difference. First operand 66152 states and 104782 transitions. Second operand 3 states. [2018-12-02 06:31:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:36,757 INFO L93 Difference]: Finished difference Result 132344 states and 209622 transitions. [2018-12-02 06:31:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:36,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-02 06:31:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:36,829 INFO L225 Difference]: With dead ends: 132344 [2018-12-02 06:31:36,830 INFO L226 Difference]: Without dead ends: 66204 [2018-12-02 06:31:36,875 INFO L631 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 [2018-12-02 06:31:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66204 states. [2018-12-02 06:31:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66204 to 66202. [2018-12-02 06:31:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66202 states. [2018-12-02 06:31:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66202 states to 66202 states and 104832 transitions. [2018-12-02 06:31:37,432 INFO L78 Accepts]: Start accepts. Automaton has 66202 states and 104832 transitions. Word has length 47 [2018-12-02 06:31:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:37,433 INFO L480 AbstractCegarLoop]: Abstraction has 66202 states and 104832 transitions. [2018-12-02 06:31:37,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 66202 states and 104832 transitions. [2018-12-02 06:31:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 06:31:37,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:37,434 INFO L402 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] [2018-12-02 06:31:37,434 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:37,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:37,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1561932951, now seen corresponding path program 1 times [2018-12-02 06:31:37,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:37,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:37,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:37,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:37,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:37,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:31:37,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:37,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:31:37,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:31:37,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:31:37,486 INFO L87 Difference]: Start difference. First operand 66202 states and 104832 transitions. Second operand 4 states. [2018-12-02 06:31:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:42,156 INFO L93 Difference]: Finished difference Result 126789 states and 200689 transitions. [2018-12-02 06:31:42,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:31:42,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-02 06:31:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:42,226 INFO L225 Difference]: With dead ends: 126789 [2018-12-02 06:31:42,226 INFO L226 Difference]: Without dead ends: 66496 [2018-12-02 06:31:42,264 INFO L631 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 [2018-12-02 06:31:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66496 states. [2018-12-02 06:31:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66496 to 63922. [2018-12-02 06:31:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63922 states. [2018-12-02 06:31:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63922 states to 63922 states and 99852 transitions. [2018-12-02 06:31:42,795 INFO L78 Accepts]: Start accepts. Automaton has 63922 states and 99852 transitions. Word has length 56 [2018-12-02 06:31:42,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:42,795 INFO L480 AbstractCegarLoop]: Abstraction has 63922 states and 99852 transitions. [2018-12-02 06:31:42,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:31:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 63922 states and 99852 transitions. [2018-12-02 06:31:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 06:31:42,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:42,796 INFO L402 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] [2018-12-02 06:31:42,796 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:42,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:42,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1199471434, now seen corresponding path program 1 times [2018-12-02 06:31:42,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:42,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:42,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 06:31:42,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:42,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:42,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:42,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:42,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:42,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:42,828 INFO L87 Difference]: Start difference. First operand 63922 states and 99852 transitions. Second operand 3 states. [2018-12-02 06:31:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:43,806 INFO L93 Difference]: Finished difference Result 127894 states and 199782 transitions. [2018-12-02 06:31:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:43,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-02 06:31:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:43,873 INFO L225 Difference]: With dead ends: 127894 [2018-12-02 06:31:43,873 INFO L226 Difference]: Without dead ends: 63984 [2018-12-02 06:31:43,916 INFO L631 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 [2018-12-02 06:31:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63984 states. [2018-12-02 06:31:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63984 to 63982. [2018-12-02 06:31:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63982 states. [2018-12-02 06:31:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63982 states to 63982 states and 99912 transitions. [2018-12-02 06:31:44,452 INFO L78 Accepts]: Start accepts. Automaton has 63982 states and 99912 transitions. Word has length 57 [2018-12-02 06:31:44,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:44,452 INFO L480 AbstractCegarLoop]: Abstraction has 63982 states and 99912 transitions. [2018-12-02 06:31:44,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 63982 states and 99912 transitions. [2018-12-02 06:31:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 06:31:44,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:44,453 INFO L402 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] [2018-12-02 06:31:44,453 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:44,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:44,453 INFO L82 PathProgramCache]: Analyzing trace with hash 384994183, now seen corresponding path program 1 times [2018-12-02 06:31:44,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:44,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:44,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 06:31:44,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:44,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:31:44,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:44,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:31:44,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:31:44,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:31:44,497 INFO L87 Difference]: Start difference. First operand 63982 states and 99912 transitions. Second operand 4 states. [2018-12-02 06:31:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:48,271 INFO L93 Difference]: Finished difference Result 116802 states and 181842 transitions. [2018-12-02 06:31:48,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:48,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 06:31:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:48,336 INFO L225 Difference]: With dead ends: 116802 [2018-12-02 06:31:48,336 INFO L226 Difference]: Without dead ends: 64992 [2018-12-02 06:31:48,368 INFO L631 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 [2018-12-02 06:31:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64992 states. [2018-12-02 06:31:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64992 to 63726. [2018-12-02 06:31:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63726 states. [2018-12-02 06:31:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63726 states to 63726 states and 98888 transitions. [2018-12-02 06:31:48,913 INFO L78 Accepts]: Start accepts. Automaton has 63726 states and 98888 transitions. Word has length 62 [2018-12-02 06:31:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:48,914 INFO L480 AbstractCegarLoop]: Abstraction has 63726 states and 98888 transitions. [2018-12-02 06:31:48,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:31:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 63726 states and 98888 transitions. [2018-12-02 06:31:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 06:31:48,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:48,915 INFO L402 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] [2018-12-02 06:31:48,915 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:48,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1635374980, now seen corresponding path program 1 times [2018-12-02 06:31:48,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:48,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:48,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:48,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:48,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:48,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:48,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:48,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:48,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:48,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:48,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:48,980 INFO L87 Difference]: Start difference. First operand 63726 states and 98888 transitions. Second operand 3 states. [2018-12-02 06:31:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:51,853 INFO L93 Difference]: Finished difference Result 129854 states and 200368 transitions. [2018-12-02 06:31:51,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:51,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-02 06:31:51,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:51,923 INFO L225 Difference]: With dead ends: 129854 [2018-12-02 06:31:51,923 INFO L226 Difference]: Without dead ends: 66100 [2018-12-02 06:31:51,965 INFO L631 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 [2018-12-02 06:31:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66100 states. [2018-12-02 06:31:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66100 to 63406. [2018-12-02 06:31:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63406 states. [2018-12-02 06:31:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63406 states to 63406 states and 98168 transitions. [2018-12-02 06:31:52,664 INFO L78 Accepts]: Start accepts. Automaton has 63406 states and 98168 transitions. Word has length 68 [2018-12-02 06:31:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:52,664 INFO L480 AbstractCegarLoop]: Abstraction has 63406 states and 98168 transitions. [2018-12-02 06:31:52,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 63406 states and 98168 transitions. [2018-12-02 06:31:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 06:31:52,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:52,666 INFO L402 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] [2018-12-02 06:31:52,666 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:52,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:52,666 INFO L82 PathProgramCache]: Analyzing trace with hash -885532883, now seen corresponding path program 1 times [2018-12-02 06:31:52,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:52,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:52,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:52,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:52,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:52,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:52,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:52,714 INFO L87 Difference]: Start difference. First operand 63406 states and 98168 transitions. Second operand 3 states. [2018-12-02 06:31:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:55,775 INFO L93 Difference]: Finished difference Result 91362 states and 140322 transitions. [2018-12-02 06:31:55,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:55,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-12-02 06:31:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:55,846 INFO L225 Difference]: With dead ends: 91362 [2018-12-02 06:31:55,847 INFO L226 Difference]: Without dead ends: 64712 [2018-12-02 06:31:55,873 INFO L631 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 [2018-12-02 06:31:55,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64712 states. [2018-12-02 06:31:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64712 to 63414. [2018-12-02 06:31:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63414 states. [2018-12-02 06:31:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63414 states to 63414 states and 98096 transitions. [2018-12-02 06:31:56,411 INFO L78 Accepts]: Start accepts. Automaton has 63414 states and 98096 transitions. Word has length 78 [2018-12-02 06:31:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:56,411 INFO L480 AbstractCegarLoop]: Abstraction has 63414 states and 98096 transitions. [2018-12-02 06:31:56,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 63414 states and 98096 transitions. [2018-12-02 06:31:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 06:31:56,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:56,412 INFO L402 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] [2018-12-02 06:31:56,412 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:56,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1721025228, now seen corresponding path program 1 times [2018-12-02 06:31:56,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:56,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:56,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:56,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:56,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 06:31:56,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:56,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:56,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:56,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:56,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:56,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:56,447 INFO L87 Difference]: Start difference. First operand 63414 states and 98096 transitions. Second operand 3 states. [2018-12-02 06:31:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:57,285 INFO L93 Difference]: Finished difference Result 121049 states and 187242 transitions. [2018-12-02 06:31:57,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:57,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-12-02 06:31:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:57,344 INFO L225 Difference]: With dead ends: 121049 [2018-12-02 06:31:57,344 INFO L226 Difference]: Without dead ends: 57647 [2018-12-02 06:31:57,385 INFO L631 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 [2018-12-02 06:31:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57647 states. [2018-12-02 06:31:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57647 to 57645. [2018-12-02 06:31:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57645 states. [2018-12-02 06:31:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57645 states to 57645 states and 89118 transitions. [2018-12-02 06:31:57,853 INFO L78 Accepts]: Start accepts. Automaton has 57645 states and 89118 transitions. Word has length 85 [2018-12-02 06:31:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:57,853 INFO L480 AbstractCegarLoop]: Abstraction has 57645 states and 89118 transitions. [2018-12-02 06:31:57,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 57645 states and 89118 transitions. [2018-12-02 06:31:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 06:31:57,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:57,854 INFO L402 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] [2018-12-02 06:31:57,854 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:57,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:57,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1640423976, now seen corresponding path program 1 times [2018-12-02 06:31:57,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:57,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:57,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:57,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:57,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 06:31:57,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:57,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:31:57,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:57,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:31:57,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:31:57,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:31:57,894 INFO L87 Difference]: Start difference. First operand 57645 states and 89118 transitions. Second operand 3 states. [2018-12-02 06:31:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:31:58,849 INFO L93 Difference]: Finished difference Result 114970 states and 177752 transitions. [2018-12-02 06:31:58,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:31:58,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-12-02 06:31:58,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:31:58,908 INFO L225 Difference]: With dead ends: 114970 [2018-12-02 06:31:58,908 INFO L226 Difference]: Without dead ends: 57727 [2018-12-02 06:31:58,944 INFO L631 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 [2018-12-02 06:31:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57727 states. [2018-12-02 06:31:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57727 to 57725. [2018-12-02 06:31:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57725 states. [2018-12-02 06:31:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57725 states to 57725 states and 89198 transitions. [2018-12-02 06:31:59,418 INFO L78 Accepts]: Start accepts. Automaton has 57725 states and 89198 transitions. Word has length 88 [2018-12-02 06:31:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:31:59,418 INFO L480 AbstractCegarLoop]: Abstraction has 57725 states and 89198 transitions. [2018-12-02 06:31:59,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:31:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 57725 states and 89198 transitions. [2018-12-02 06:31:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 06:31:59,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:31:59,419 INFO L402 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] [2018-12-02 06:31:59,419 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:31:59,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:31:59,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1152445607, now seen corresponding path program 1 times [2018-12-02 06:31:59,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:31:59,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:59,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:31:59,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:31:59,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:31:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:31:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:31:59,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:31:59,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:31:59,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:31:59,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:31:59,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:31:59,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:31:59,493 INFO L87 Difference]: Start difference. First operand 57725 states and 89198 transitions. Second operand 4 states. [2018-12-02 06:32:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:32:02,866 INFO L93 Difference]: Finished difference Result 82683 states and 126801 transitions. [2018-12-02 06:32:02,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:32:02,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 06:32:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:32:02,902 INFO L225 Difference]: With dead ends: 82683 [2018-12-02 06:32:02,902 INFO L226 Difference]: Without dead ends: 36254 [2018-12-02 06:32:02,930 INFO L631 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 [2018-12-02 06:32:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36254 states. [2018-12-02 06:32:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36254 to 35103. [2018-12-02 06:32:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35103 states. [2018-12-02 06:32:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35103 states to 35103 states and 53387 transitions. [2018-12-02 06:32:03,215 INFO L78 Accepts]: Start accepts. Automaton has 35103 states and 53387 transitions. Word has length 92 [2018-12-02 06:32:03,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:32:03,215 INFO L480 AbstractCegarLoop]: Abstraction has 35103 states and 53387 transitions. [2018-12-02 06:32:03,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:32:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 35103 states and 53387 transitions. [2018-12-02 06:32:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:32:03,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:32:03,217 INFO L402 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] [2018-12-02 06:32:03,217 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:32:03,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:32:03,217 INFO L82 PathProgramCache]: Analyzing trace with hash 956074825, now seen corresponding path program 1 times [2018-12-02 06:32:03,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:32:03,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:03,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:32:03,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:03,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:32:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:32:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:32:03,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:32:03,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:32:03,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:32:03,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:32:03,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:32:03,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:32:03,292 INFO L87 Difference]: Start difference. First operand 35103 states and 53387 transitions. Second operand 4 states. [2018-12-02 06:32:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:32:07,353 INFO L93 Difference]: Finished difference Result 48621 states and 72992 transitions. [2018-12-02 06:32:07,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:32:07,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 06:32:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:32:07,377 INFO L225 Difference]: With dead ends: 48621 [2018-12-02 06:32:07,377 INFO L226 Difference]: Without dead ends: 24954 [2018-12-02 06:32:07,390 INFO L631 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 [2018-12-02 06:32:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24954 states. [2018-12-02 06:32:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24954 to 23803. [2018-12-02 06:32:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23803 states. [2018-12-02 06:32:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23803 states to 23803 states and 35865 transitions. [2018-12-02 06:32:07,566 INFO L78 Accepts]: Start accepts. Automaton has 23803 states and 35865 transitions. Word has length 94 [2018-12-02 06:32:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:32:07,566 INFO L480 AbstractCegarLoop]: Abstraction has 23803 states and 35865 transitions. [2018-12-02 06:32:07,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:32:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23803 states and 35865 transitions. [2018-12-02 06:32:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 06:32:07,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:32:07,567 INFO L402 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, 1, 1, 1, 1, 1] [2018-12-02 06:32:07,567 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:32:07,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:32:07,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1811539215, now seen corresponding path program 1 times [2018-12-02 06:32:07,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:32:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:07,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:32:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:07,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:32:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:32:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:32:07,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:32:07,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:32:07,610 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:32:07,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:32:07,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:32:07,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:32:07,611 INFO L87 Difference]: Start difference. First operand 23803 states and 35865 transitions. Second operand 3 states. [2018-12-02 06:32:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:32:08,251 INFO L93 Difference]: Finished difference Result 24578 states and 36978 transitions. [2018-12-02 06:32:08,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:32:08,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-02 06:32:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:32:08,274 INFO L225 Difference]: With dead ends: 24578 [2018-12-02 06:32:08,275 INFO L226 Difference]: Without dead ends: 24576 [2018-12-02 06:32:08,282 INFO L631 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 [2018-12-02 06:32:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24576 states. [2018-12-02 06:32:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24576 to 24574. [2018-12-02 06:32:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24574 states. [2018-12-02 06:32:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24574 states to 24574 states and 36968 transitions. [2018-12-02 06:32:08,458 INFO L78 Accepts]: Start accepts. Automaton has 24574 states and 36968 transitions. Word has length 102 [2018-12-02 06:32:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:32:08,458 INFO L480 AbstractCegarLoop]: Abstraction has 24574 states and 36968 transitions. [2018-12-02 06:32:08,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:32:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 24574 states and 36968 transitions. [2018-12-02 06:32:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-02 06:32:08,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:32:08,460 INFO L402 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] [2018-12-02 06:32:08,460 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:32:08,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:32:08,460 INFO L82 PathProgramCache]: Analyzing trace with hash 316824858, now seen corresponding path program 1 times [2018-12-02 06:32:08,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:32:08,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:08,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:32:08,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:08,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:32:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:32:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 06:32:08,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:32:08,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:32:08,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:32:08,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:32:08,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:32:08,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:32:08,508 INFO L87 Difference]: Start difference. First operand 24574 states and 36968 transitions. Second operand 3 states. [2018-12-02 06:32:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:32:09,094 INFO L93 Difference]: Finished difference Result 42970 states and 64452 transitions. [2018-12-02 06:32:09,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:32:09,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-12-02 06:32:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:32:09,109 INFO L225 Difference]: With dead ends: 42970 [2018-12-02 06:32:09,109 INFO L226 Difference]: Without dead ends: 19569 [2018-12-02 06:32:09,123 INFO L631 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 [2018-12-02 06:32:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19569 states. [2018-12-02 06:32:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19569 to 19567. [2018-12-02 06:32:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19567 states. [2018-12-02 06:32:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19567 states to 19567 states and 29153 transitions. [2018-12-02 06:32:09,269 INFO L78 Accepts]: Start accepts. Automaton has 19567 states and 29153 transitions. Word has length 118 [2018-12-02 06:32:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:32:09,269 INFO L480 AbstractCegarLoop]: Abstraction has 19567 states and 29153 transitions. [2018-12-02 06:32:09,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:32:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 19567 states and 29153 transitions. [2018-12-02 06:32:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 06:32:09,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:32:09,271 INFO L402 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, 1, 1, 1] [2018-12-02 06:32:09,271 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:32:09,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:32:09,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1013835941, now seen corresponding path program 1 times [2018-12-02 06:32:09,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:32:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:09,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:32:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:09,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:32:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:32:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 06:32:09,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:32:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:32:09,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:32:09,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:32:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:32:09,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:32:09,308 INFO L87 Difference]: Start difference. First operand 19567 states and 29153 transitions. Second operand 3 states. [2018-12-02 06:32:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:32:09,906 INFO L93 Difference]: Finished difference Result 36152 states and 53948 transitions. [2018-12-02 06:32:09,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:32:09,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-12-02 06:32:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:32:09,922 INFO L225 Difference]: With dead ends: 36152 [2018-12-02 06:32:09,922 INFO L226 Difference]: Without dead ends: 17948 [2018-12-02 06:32:09,932 INFO L631 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 [2018-12-02 06:32:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17948 states. [2018-12-02 06:32:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17948 to 17946. [2018-12-02 06:32:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17946 states. [2018-12-02 06:32:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17946 states to 17946 states and 26737 transitions. [2018-12-02 06:32:10,064 INFO L78 Accepts]: Start accepts. Automaton has 17946 states and 26737 transitions. Word has length 140 [2018-12-02 06:32:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:32:10,064 INFO L480 AbstractCegarLoop]: Abstraction has 17946 states and 26737 transitions. [2018-12-02 06:32:10,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:32:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 17946 states and 26737 transitions. [2018-12-02 06:32:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-02 06:32:10,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:32:10,066 INFO L402 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, 1, 1, 1, 1, 1] [2018-12-02 06:32:10,066 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:32:10,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:32:10,066 INFO L82 PathProgramCache]: Analyzing trace with hash 979116920, now seen corresponding path program 1 times [2018-12-02 06:32:10,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:32:10,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:10,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:32:10,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:10,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:32:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:32:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 06:32:10,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:32:10,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:32:10,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:32:10,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:32:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:32:10,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:32:10,131 INFO L87 Difference]: Start difference. First operand 17946 states and 26737 transitions. Second operand 3 states. [2018-12-02 06:32:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:32:10,808 INFO L93 Difference]: Finished difference Result 29254 states and 43532 transitions. [2018-12-02 06:32:10,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:32:10,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2018-12-02 06:32:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:32:10,819 INFO L225 Difference]: With dead ends: 29254 [2018-12-02 06:32:10,819 INFO L226 Difference]: Without dead ends: 13062 [2018-12-02 06:32:10,828 INFO L631 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 [2018-12-02 06:32:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13062 states. [2018-12-02 06:32:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13062 to 13060. [2018-12-02 06:32:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13060 states. [2018-12-02 06:32:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13060 states to 13060 states and 19302 transitions. [2018-12-02 06:32:10,925 INFO L78 Accepts]: Start accepts. Automaton has 13060 states and 19302 transitions. Word has length 142 [2018-12-02 06:32:10,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:32:10,925 INFO L480 AbstractCegarLoop]: Abstraction has 13060 states and 19302 transitions. [2018-12-02 06:32:10,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:32:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 13060 states and 19302 transitions. [2018-12-02 06:32:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 06:32:10,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:32:10,927 INFO L402 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, 1] [2018-12-02 06:32:10,927 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:32:10,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:32:10,928 INFO L82 PathProgramCache]: Analyzing trace with hash 613887253, now seen corresponding path program 1 times [2018-12-02 06:32:10,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:32:10,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:10,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:32:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:10,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:32:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:32:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 06:32:10,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:32:10,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:32:10,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:32:10,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:32:10,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:32:10,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:32:10,972 INFO L87 Difference]: Start difference. First operand 13060 states and 19302 transitions. Second operand 3 states. [2018-12-02 06:32:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:32:11,535 INFO L93 Difference]: Finished difference Result 23530 states and 34857 transitions. [2018-12-02 06:32:11,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:32:11,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-12-02 06:32:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:32:11,544 INFO L225 Difference]: With dead ends: 23530 [2018-12-02 06:32:11,544 INFO L226 Difference]: Without dead ends: 12419 [2018-12-02 06:32:11,551 INFO L631 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 [2018-12-02 06:32:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12419 states. [2018-12-02 06:32:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12419 to 12417. [2018-12-02 06:32:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12417 states. [2018-12-02 06:32:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12417 states to 12417 states and 18336 transitions. [2018-12-02 06:32:11,644 INFO L78 Accepts]: Start accepts. Automaton has 12417 states and 18336 transitions. Word has length 148 [2018-12-02 06:32:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:32:11,644 INFO L480 AbstractCegarLoop]: Abstraction has 12417 states and 18336 transitions. [2018-12-02 06:32:11,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:32:11,644 INFO L276 IsEmpty]: Start isEmpty. Operand 12417 states and 18336 transitions. [2018-12-02 06:32:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 06:32:11,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:32:11,646 INFO L402 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, 1, 1, 1, 1, 1] [2018-12-02 06:32:11,646 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:32:11,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:32:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash -398003814, now seen corresponding path program 1 times [2018-12-02 06:32:11,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:32:11,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:11,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:32:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:11,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:32:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:32:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 06:32:11,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:32:11,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:32:11,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:32:11,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:32:11,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:32:11,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:32:11,692 INFO L87 Difference]: Start difference. First operand 12417 states and 18336 transitions. Second operand 3 states. [2018-12-02 06:32:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:32:12,244 INFO L93 Difference]: Finished difference Result 22917 states and 33915 transitions. [2018-12-02 06:32:12,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:32:12,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-12-02 06:32:12,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:32:12,252 INFO L225 Difference]: With dead ends: 22917 [2018-12-02 06:32:12,252 INFO L226 Difference]: Without dead ends: 12449 [2018-12-02 06:32:12,258 INFO L631 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 [2018-12-02 06:32:12,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12449 states. [2018-12-02 06:32:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12449 to 12447. [2018-12-02 06:32:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12447 states. [2018-12-02 06:32:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12447 states to 12447 states and 18366 transitions. [2018-12-02 06:32:12,352 INFO L78 Accepts]: Start accepts. Automaton has 12447 states and 18366 transitions. Word has length 152 [2018-12-02 06:32:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:32:12,352 INFO L480 AbstractCegarLoop]: Abstraction has 12447 states and 18366 transitions. [2018-12-02 06:32:12,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:32:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 12447 states and 18366 transitions. [2018-12-02 06:32:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-02 06:32:12,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:32:12,354 INFO L402 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] [2018-12-02 06:32:12,354 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:32:12,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:32:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash 937599923, now seen corresponding path program 1 times [2018-12-02 06:32:12,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:32:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:12,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:32:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:12,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:32:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:32:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 06:32:12,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:32:12,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:32:12,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:32:12,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:32:12,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:32:12,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:32:12,404 INFO L87 Difference]: Start difference. First operand 12447 states and 18366 transitions. Second operand 3 states. [2018-12-02 06:32:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:32:12,822 INFO L93 Difference]: Finished difference Result 20619 states and 30503 transitions. [2018-12-02 06:32:12,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:32:12,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-12-02 06:32:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:32:12,830 INFO L225 Difference]: With dead ends: 20619 [2018-12-02 06:32:12,830 INFO L226 Difference]: Without dead ends: 10121 [2018-12-02 06:32:12,837 INFO L631 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 [2018-12-02 06:32:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10121 states. [2018-12-02 06:32:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10121 to 10119. [2018-12-02 06:32:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10119 states. [2018-12-02 06:32:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10119 states to 10119 states and 14916 transitions. [2018-12-02 06:32:12,908 INFO L78 Accepts]: Start accepts. Automaton has 10119 states and 14916 transitions. Word has length 182 [2018-12-02 06:32:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:32:12,908 INFO L480 AbstractCegarLoop]: Abstraction has 10119 states and 14916 transitions. [2018-12-02 06:32:12,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:32:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 10119 states and 14916 transitions. [2018-12-02 06:32:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-02 06:32:12,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:32:12,910 INFO L402 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, 1, 1, 1, 1, 1] [2018-12-02 06:32:12,911 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:32:12,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:32:12,911 INFO L82 PathProgramCache]: Analyzing trace with hash -624398577, now seen corresponding path program 1 times [2018-12-02 06:32:12,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:32:12,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:12,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:32:12,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:12,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:32:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:32:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 06:32:12,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:32:12,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:32:12,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:32:12,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:32:12,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:32:12,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:32:12,964 INFO L87 Difference]: Start difference. First operand 10119 states and 14916 transitions. Second operand 3 states. [2018-12-02 06:32:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:32:13,145 INFO L93 Difference]: Finished difference Result 10525 states and 15485 transitions. [2018-12-02 06:32:13,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:32:13,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2018-12-02 06:32:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:32:13,147 INFO L225 Difference]: With dead ends: 10525 [2018-12-02 06:32:13,147 INFO L226 Difference]: Without dead ends: 2361 [2018-12-02 06:32:13,151 INFO L631 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 [2018-12-02 06:32:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2018-12-02 06:32:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2359. [2018-12-02 06:32:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2018-12-02 06:32:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 3363 transitions. [2018-12-02 06:32:13,166 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 3363 transitions. Word has length 187 [2018-12-02 06:32:13,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:32:13,166 INFO L480 AbstractCegarLoop]: Abstraction has 2359 states and 3363 transitions. [2018-12-02 06:32:13,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:32:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 3363 transitions. [2018-12-02 06:32:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-02 06:32:13,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:32:13,167 INFO L402 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, 1, 1, 1, 1, 1] [2018-12-02 06:32:13,167 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:32:13,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:32:13,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1061043629, now seen corresponding path program 1 times [2018-12-02 06:32:13,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:32:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:13,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:32:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:32:13,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:32:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:32:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:32:13,342 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 06:32:13,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:32:13 BoogieIcfgContainer [2018-12-02 06:32:13,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 06:32:13,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:32:13,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:32:13,443 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:32:13,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:31:12" (3/4) ... [2018-12-02 06:32:13,446 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 06:32:13,544 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3a3206ec-13fd-4db9-b81e-8da49e0386ce/bin-2019/utaipan/witness.graphml [2018-12-02 06:32:13,544 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:32:13,545 INFO L168 Benchmark]: Toolchain (without parser) took 73137.56 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 893.3 MB in the beginning and 2.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-02 06:32:13,546 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:32:13,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1776.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 893.3 MB in the beginning and 851.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 316.3 MB. Max. memory is 11.5 GB. [2018-12-02 06:32:13,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.62 ms. Allocated memory is still 1.3 GB. Free memory was 851.7 MB in the beginning and 842.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-12-02 06:32:13,547 INFO L168 Benchmark]: Boogie Preprocessor took 537.13 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 318.2 MB). Free memory was 842.4 MB in the beginning and 1.3 GB in the end (delta: -498.5 MB). Peak memory consumption was 262.3 MB. Max. memory is 11.5 GB. [2018-12-02 06:32:13,547 INFO L168 Benchmark]: RCFGBuilder took 9328.75 ms. Allocated memory was 1.6 GB in the beginning and 2.1 GB in the end (delta: 498.1 MB). Free memory was 1.3 GB in the beginning and 753.3 MB in the end (delta: 587.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-02 06:32:13,547 INFO L168 Benchmark]: TraceAbstraction took 61305.30 ms. Allocated memory was 2.1 GB in the beginning and 4.1 GB in the end (delta: 2.0 GB). Free memory was 753.3 MB in the beginning and 2.8 GB in the end (delta: -2.0 GB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:32:13,548 INFO L168 Benchmark]: Witness Printer took 101.17 ms. Allocated memory is still 4.1 GB. Free memory is still 2.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:32:13,549 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1776.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 893.3 MB in the beginning and 851.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 316.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.62 ms. Allocated memory is still 1.3 GB. Free memory was 851.7 MB in the beginning and 842.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 537.13 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 318.2 MB). Free memory was 842.4 MB in the beginning and 1.3 GB in the end (delta: -498.5 MB). Peak memory consumption was 262.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 9328.75 ms. Allocated memory was 1.6 GB in the beginning and 2.1 GB in the end (delta: 498.1 MB). Free memory was 1.3 GB in the beginning and 753.3 MB in the end (delta: 587.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * TraceAbstraction took 61305.30 ms. Allocated memory was 2.1 GB in the beginning and 4.1 GB in the end (delta: 2.0 GB). Free memory was 753.3 MB in the beginning and 2.8 GB in the end (delta: -2.0 GB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 101.17 ms. Allocated memory is still 4.1 GB. Free memory is still 2.8 GB. There was no memory consumed. 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; VAL [\old(m_bind)=26, \old(m_close)=52, \old(m_connect1_1)=28, \old(m_connect1_2)=45, \old(m_connect2_1)=17, \old(m_connect2_2)=22, \old(m_createImpl)=13, \old(m_getChannel)=46, \old(m_getImpl)=36, \old(m_getInetAddress)=7, \old(m_getInputStream)=6, \old(m_getKeepAlive)=33, \old(m_getLocalAddress)=38, \old(m_getLocalPort)=15, \old(m_getLocalSocketAddress)=48, \old(m_getOOBInline)=4, \old(m_getOutputStream)=42, \old(m_getPort)=25, \old(m_getReceiveBufferSize)=9, \old(m_getRemoteSocketAddress)=10, \old(m_getReuseAddress)=56, \old(m_getSendBufferSize)=21, \old(m_getSoLinger)=53, \old(m_getSoTimeout)=47, \old(m_getTcpNoDelay)=34, \old(m_getTrafficClass)=39, \old(m_isBound)=11, \old(m_isClosed)=5, \old(m_isConnected)=8, \old(m_isInputShutdown)=20, \old(m_isOutputShutdown)=31, \old(m_postAccept)=37, \old(m_sendUrgentData)=29, \old(m_setBound)=14, \old(m_setConnected)=27, \old(m_setCreated)=49, \old(m_setKeepAlive)=40, \old(m_setOOBInline)=23, \old(m_setPerformancePreferences)=43, \old(m_setReceiveBufferSize_1)=35, \old(m_setReceiveBufferSize_2)=44, \old(m_setReuseAddress)=55, \old(m_setSendBufferSize_1)=19, \old(m_setSendBufferSize_2)=12, \old(m_setSocketImplFactory_1)=2, \old(m_setSocketImplFactory_2)=54, \old(m_setSoLinger_1)=57, \old(m_setSoLinger_2)=30, \old(m_setSoTimeout_1)=32, \old(m_setSoTimeout_2)=41, \old(m_setTcpNoDelay)=51, \old(m_setTrafficClass_1)=18, \old(m_setTrafficClass_2)=24, \old(m_shutdownInput)=16, \old(m_shutdownOutput)=50, \old(m_Socket)=3, 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] [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, q=0, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [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, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=1, P30=0, P4=0, P5=1, P6=1, P7=0, P8=0, P9=0, q=0, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [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, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=1, P30=0, P4=0, P5=1, P6=1, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [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, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [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, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [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, method_id=56, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [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, method_id=56, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [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, method_id=56, P1=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=1, P3=1, P30=0, P4=0, P5=1, P6=1, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [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, method_id=56, P1=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=1, P3=1, P30=0, P4=0, P5=1, P6=1, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [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, method_id=55, P1=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=1, P3=1, P30=0, P4=0, P5=1, P6=1, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [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, method_id=55, P1=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=1, P3=1, P30=0, P4=0, P5=1, P6=1, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [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, method_id=55, P1=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=1, P3=1, P30=0, P4=0, P5=1, P6=1, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 9216 locations, 1 error locations. UNSAFE Result, 61.2s OverallTime, 28 OverallIterations, 4 TraceHistogramMax, 52.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 310329 SDtfs, 200627 SDslu, 192977 SDs, 0 SdLazy, 55854 SolverSat, 21037 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66202occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 16312 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2318 NumberOfCodeBlocks, 2318 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2099 ConstructedInterpolants, 0 QuantifiedInterpolants, 533396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 214/214 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...