./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:32:19,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:32:19,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:32:19,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:32:19,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:32:19,390 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:32:19,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:32:19,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:32:19,393 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:32:19,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:32:19,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:32:19,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:32:19,395 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:32:19,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:32:19,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:32:19,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:32:19,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:32:19,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:32:19,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:32:19,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:32:19,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:32:19,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:32:19,406 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:32:19,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:32:19,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:32:19,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:32:19,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:32:19,408 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:32:19,408 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:32:19,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:32:19,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:32:19,410 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:32:19,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:32:19,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:32:19,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:32:19,411 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:32:19,411 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 11:32:19,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:32:19,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:32:19,421 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:32:19,422 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:32:19,422 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:32:19,422 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:32:19,422 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:32:19,422 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 11:32:19,422 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:32:19,422 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:32:19,422 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 11:32:19,422 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 11:32:19,422 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:32:19,423 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:32:19,423 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:32:19,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:32:19,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:32:19,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:32:19,424 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:32:19,424 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:32:19,424 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:32:19,424 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:32:19,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:32:19,424 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:32:19,424 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:32:19,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:32:19,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:32:19,425 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:32:19,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:32:19,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:32:19,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:32:19,427 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:32:19,427 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:32:19,427 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 11:32:19,427 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:32:19,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:32:19,427 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 11:32:19,427 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_8ce0d62b-6f9c-4816-8050-7d08217370c4/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2018-11-18 11:32:19,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:32:19,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:32:19,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:32:19,463 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:32:19,463 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:32:19,463 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:32:19,498 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/bin-2019/utaipan/data/a275d85a5/83e6fbc940474fe98c726c8cfe55f065/FLAG015a4eb43 [2018-11-18 11:32:19,848 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:32:19,849 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:32:19,854 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/bin-2019/utaipan/data/a275d85a5/83e6fbc940474fe98c726c8cfe55f065/FLAG015a4eb43 [2018-11-18 11:32:20,268 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/bin-2019/utaipan/data/a275d85a5/83e6fbc940474fe98c726c8cfe55f065 [2018-11-18 11:32:20,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:32:20,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:32:20,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:32:20,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:32:20,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:32:20,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:32:20" (1/1) ... [2018-11-18 11:32:20,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec7e158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20, skipping insertion in model container [2018-11-18 11:32:20,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:32:20" (1/1) ... [2018-11-18 11:32:20,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:32:20,297 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:32:20,416 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:32:20,419 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:32:20,437 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:32:20,445 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:32:20,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20 WrapperNode [2018-11-18 11:32:20,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:32:20,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:32:20,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:32:20,446 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:32:20,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20" (1/1) ... [2018-11-18 11:32:20,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20" (1/1) ... [2018-11-18 11:32:20,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:32:20,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:32:20,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:32:20,458 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:32:20,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20" (1/1) ... [2018-11-18 11:32:20,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20" (1/1) ... [2018-11-18 11:32:20,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20" (1/1) ... [2018-11-18 11:32:20,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20" (1/1) ... [2018-11-18 11:32:20,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20" (1/1) ... [2018-11-18 11:32:20,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20" (1/1) ... [2018-11-18 11:32:20,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20" (1/1) ... [2018-11-18 11:32:20,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:32:20,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:32:20,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:32:20,510 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:32:20,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/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-11-18 11:32:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:32:20,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:32:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:32:20,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:32:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:32:20,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:32:20,746 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:32:20,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:32:20 BoogieIcfgContainer [2018-11-18 11:32:20,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:32:20,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:32:20,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:32:20,749 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:32:20,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:32:20" (1/3) ... [2018-11-18 11:32:20,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3844bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:32:20, skipping insertion in model container [2018-11-18 11:32:20,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:32:20" (2/3) ... [2018-11-18 11:32:20,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3844bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:32:20, skipping insertion in model container [2018-11-18 11:32:20,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:32:20" (3/3) ... [2018-11-18 11:32:20,751 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:32:20,756 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:32:20,761 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:32:20,771 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:32:20,790 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:32:20,790 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:32:20,790 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:32:20,790 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:32:20,790 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:32:20,790 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:32:20,790 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:32:20,790 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:32:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-18 11:32:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:32:20,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:20,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:20,809 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:20,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:20,813 INFO L82 PathProgramCache]: Analyzing trace with hash -731061561, now seen corresponding path program 1 times [2018-11-18 11:32:20,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:20,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:20,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:20,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:20,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:20,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:20,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:20,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:20,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:20,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:20,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:20,958 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-11-18 11:32:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,003 INFO L93 Difference]: Finished difference Result 107 states and 188 transitions. [2018-11-18 11:32:21,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 11:32:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,013 INFO L225 Difference]: With dead ends: 107 [2018-11-18 11:32:21,013 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 11:32:21,015 INFO L604 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-11-18 11:32:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 11:32:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 63. [2018-11-18 11:32:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 11:32:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2018-11-18 11:32:21,039 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2018-11-18 11:32:21,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,040 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2018-11-18 11:32:21,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,040 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2018-11-18 11:32:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:32:21,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,041 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,041 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1752129915, now seen corresponding path program 1 times [2018-11-18 11:32:21,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,090 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand 3 states. [2018-11-18 11:32:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,115 INFO L93 Difference]: Finished difference Result 150 states and 275 transitions. [2018-11-18 11:32:21,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 11:32:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,117 INFO L225 Difference]: With dead ends: 150 [2018-11-18 11:32:21,117 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 11:32:21,118 INFO L604 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-11-18 11:32:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 11:32:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-18 11:32:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 11:32:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 163 transitions. [2018-11-18 11:32:21,126 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 163 transitions. Word has length 24 [2018-11-18 11:32:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,127 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 163 transitions. [2018-11-18 11:32:21,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2018-11-18 11:32:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:32:21,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,128 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,128 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1187859502, now seen corresponding path program 1 times [2018-11-18 11:32:21,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,167 INFO L87 Difference]: Start difference. First operand 90 states and 163 transitions. Second operand 3 states. [2018-11-18 11:32:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,181 INFO L93 Difference]: Finished difference Result 139 states and 247 transitions. [2018-11-18 11:32:21,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:32:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,183 INFO L225 Difference]: With dead ends: 139 [2018-11-18 11:32:21,183 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 11:32:21,183 INFO L604 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-11-18 11:32:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 11:32:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-18 11:32:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 11:32:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 166 transitions. [2018-11-18 11:32:21,190 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 166 transitions. Word has length 25 [2018-11-18 11:32:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,191 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 166 transitions. [2018-11-18 11:32:21,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 166 transitions. [2018-11-18 11:32:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:32:21,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,192 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,192 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1518759892, now seen corresponding path program 1 times [2018-11-18 11:32:21,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,228 INFO L87 Difference]: Start difference. First operand 94 states and 166 transitions. Second operand 3 states. [2018-11-18 11:32:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,244 INFO L93 Difference]: Finished difference Result 177 states and 317 transitions. [2018-11-18 11:32:21,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:32:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,246 INFO L225 Difference]: With dead ends: 177 [2018-11-18 11:32:21,246 INFO L226 Difference]: Without dead ends: 175 [2018-11-18 11:32:21,246 INFO L604 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-11-18 11:32:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-18 11:32:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 123. [2018-11-18 11:32:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 11:32:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 219 transitions. [2018-11-18 11:32:21,254 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 219 transitions. Word has length 25 [2018-11-18 11:32:21,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,254 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 219 transitions. [2018-11-18 11:32:21,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 219 transitions. [2018-11-18 11:32:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:32:21,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,255 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,255 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash 497691538, now seen corresponding path program 1 times [2018-11-18 11:32:21,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,291 INFO L87 Difference]: Start difference. First operand 123 states and 219 transitions. Second operand 3 states. [2018-11-18 11:32:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,306 INFO L93 Difference]: Finished difference Result 291 states and 525 transitions. [2018-11-18 11:32:21,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:32:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,308 INFO L225 Difference]: With dead ends: 291 [2018-11-18 11:32:21,308 INFO L226 Difference]: Without dead ends: 177 [2018-11-18 11:32:21,308 INFO L604 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-11-18 11:32:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-18 11:32:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-11-18 11:32:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-18 11:32:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 311 transitions. [2018-11-18 11:32:21,315 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 311 transitions. Word has length 25 [2018-11-18 11:32:21,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,316 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 311 transitions. [2018-11-18 11:32:21,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 311 transitions. [2018-11-18 11:32:21,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:32:21,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,317 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,317 INFO L82 PathProgramCache]: Analyzing trace with hash -162870854, now seen corresponding path program 1 times [2018-11-18 11:32:21,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,355 INFO L87 Difference]: Start difference. First operand 175 states and 311 transitions. Second operand 3 states. [2018-11-18 11:32:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,371 INFO L93 Difference]: Finished difference Result 262 states and 464 transitions. [2018-11-18 11:32:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:32:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,372 INFO L225 Difference]: With dead ends: 262 [2018-11-18 11:32:21,372 INFO L226 Difference]: Without dead ends: 179 [2018-11-18 11:32:21,373 INFO L604 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-11-18 11:32:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-18 11:32:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-11-18 11:32:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 11:32:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 311 transitions. [2018-11-18 11:32:21,380 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 311 transitions. Word has length 26 [2018-11-18 11:32:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,381 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 311 transitions. [2018-11-18 11:32:21,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 311 transitions. [2018-11-18 11:32:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:32:21,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,382 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,382 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1751218756, now seen corresponding path program 1 times [2018-11-18 11:32:21,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,404 INFO L87 Difference]: Start difference. First operand 177 states and 311 transitions. Second operand 3 states. [2018-11-18 11:32:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,424 INFO L93 Difference]: Finished difference Result 333 states and 593 transitions. [2018-11-18 11:32:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:32:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,425 INFO L225 Difference]: With dead ends: 333 [2018-11-18 11:32:21,426 INFO L226 Difference]: Without dead ends: 331 [2018-11-18 11:32:21,426 INFO L604 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-11-18 11:32:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-18 11:32:21,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 237. [2018-11-18 11:32:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-18 11:32:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 415 transitions. [2018-11-18 11:32:21,433 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 415 transitions. Word has length 26 [2018-11-18 11:32:21,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,434 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 415 transitions. [2018-11-18 11:32:21,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,434 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 415 transitions. [2018-11-18 11:32:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:32:21,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,435 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,435 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1522680186, now seen corresponding path program 1 times [2018-11-18 11:32:21,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,458 INFO L87 Difference]: Start difference. First operand 237 states and 415 transitions. Second operand 3 states. [2018-11-18 11:32:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,483 INFO L93 Difference]: Finished difference Result 565 states and 997 transitions. [2018-11-18 11:32:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:32:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,486 INFO L225 Difference]: With dead ends: 565 [2018-11-18 11:32:21,486 INFO L226 Difference]: Without dead ends: 339 [2018-11-18 11:32:21,487 INFO L604 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-11-18 11:32:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-18 11:32:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-11-18 11:32:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-18 11:32:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 587 transitions. [2018-11-18 11:32:21,496 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 587 transitions. Word has length 26 [2018-11-18 11:32:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,497 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 587 transitions. [2018-11-18 11:32:21,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 587 transitions. [2018-11-18 11:32:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 11:32:21,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,498 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,498 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1547006503, now seen corresponding path program 1 times [2018-11-18 11:32:21,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,527 INFO L87 Difference]: Start difference. First operand 337 states and 587 transitions. Second operand 3 states. [2018-11-18 11:32:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,545 INFO L93 Difference]: Finished difference Result 505 states and 877 transitions. [2018-11-18 11:32:21,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 11:32:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,547 INFO L225 Difference]: With dead ends: 505 [2018-11-18 11:32:21,548 INFO L226 Difference]: Without dead ends: 343 [2018-11-18 11:32:21,548 INFO L604 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-11-18 11:32:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-18 11:32:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-11-18 11:32:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-18 11:32:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 587 transitions. [2018-11-18 11:32:21,562 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 587 transitions. Word has length 27 [2018-11-18 11:32:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,562 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 587 transitions. [2018-11-18 11:32:21,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 587 transitions. [2018-11-18 11:32:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 11:32:21,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,564 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash -41341399, now seen corresponding path program 1 times [2018-11-18 11:32:21,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,604 INFO L87 Difference]: Start difference. First operand 341 states and 587 transitions. Second operand 3 states. [2018-11-18 11:32:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,620 INFO L93 Difference]: Finished difference Result 637 states and 1113 transitions. [2018-11-18 11:32:21,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 11:32:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,622 INFO L225 Difference]: With dead ends: 637 [2018-11-18 11:32:21,622 INFO L226 Difference]: Without dead ends: 635 [2018-11-18 11:32:21,623 INFO L604 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-11-18 11:32:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-11-18 11:32:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 465. [2018-11-18 11:32:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-18 11:32:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 791 transitions. [2018-11-18 11:32:21,636 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 791 transitions. Word has length 27 [2018-11-18 11:32:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,637 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 791 transitions. [2018-11-18 11:32:21,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 791 transitions. [2018-11-18 11:32:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 11:32:21,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,638 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1062409753, now seen corresponding path program 1 times [2018-11-18 11:32:21,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,665 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,666 INFO L87 Difference]: Start difference. First operand 465 states and 791 transitions. Second operand 3 states. [2018-11-18 11:32:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,699 INFO L93 Difference]: Finished difference Result 1109 states and 1897 transitions. [2018-11-18 11:32:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 11:32:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,701 INFO L225 Difference]: With dead ends: 1109 [2018-11-18 11:32:21,702 INFO L226 Difference]: Without dead ends: 659 [2018-11-18 11:32:21,703 INFO L604 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-11-18 11:32:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-18 11:32:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2018-11-18 11:32:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-18 11:32:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1111 transitions. [2018-11-18 11:32:21,722 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1111 transitions. Word has length 27 [2018-11-18 11:32:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,723 INFO L480 AbstractCegarLoop]: Abstraction has 657 states and 1111 transitions. [2018-11-18 11:32:21,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1111 transitions. [2018-11-18 11:32:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:32:21,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,724 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,724 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1281369937, now seen corresponding path program 1 times [2018-11-18 11:32:21,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,744 INFO L87 Difference]: Start difference. First operand 657 states and 1111 transitions. Second operand 3 states. [2018-11-18 11:32:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,802 INFO L93 Difference]: Finished difference Result 985 states and 1661 transitions. [2018-11-18 11:32:21,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 11:32:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,805 INFO L225 Difference]: With dead ends: 985 [2018-11-18 11:32:21,805 INFO L226 Difference]: Without dead ends: 667 [2018-11-18 11:32:21,806 INFO L604 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-11-18 11:32:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-18 11:32:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2018-11-18 11:32:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-18 11:32:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1111 transitions. [2018-11-18 11:32:21,825 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1111 transitions. Word has length 28 [2018-11-18 11:32:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,825 INFO L480 AbstractCegarLoop]: Abstraction has 665 states and 1111 transitions. [2018-11-18 11:32:21,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1111 transitions. [2018-11-18 11:32:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:32:21,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,826 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,826 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1425249457, now seen corresponding path program 1 times [2018-11-18 11:32:21,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,856 INFO L87 Difference]: Start difference. First operand 665 states and 1111 transitions. Second operand 3 states. [2018-11-18 11:32:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,891 INFO L93 Difference]: Finished difference Result 1933 states and 3225 transitions. [2018-11-18 11:32:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 11:32:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,896 INFO L225 Difference]: With dead ends: 1933 [2018-11-18 11:32:21,896 INFO L226 Difference]: Without dead ends: 1291 [2018-11-18 11:32:21,897 INFO L604 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-11-18 11:32:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-11-18 11:32:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2018-11-18 11:32:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-18 11:32:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2119 transitions. [2018-11-18 11:32:21,931 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2119 transitions. Word has length 28 [2018-11-18 11:32:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:21,931 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2119 transitions. [2018-11-18 11:32:21,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2119 transitions. [2018-11-18 11:32:21,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:32:21,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:21,933 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:21,933 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:21,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:21,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1848649485, now seen corresponding path program 1 times [2018-11-18 11:32:21,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:21,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:21,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:21,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:21,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:21,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:21,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:21,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:21,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:21,959 INFO L87 Difference]: Start difference. First operand 1289 states and 2119 transitions. Second operand 3 states. [2018-11-18 11:32:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:21,987 INFO L93 Difference]: Finished difference Result 1597 states and 2681 transitions. [2018-11-18 11:32:21,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:21,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 11:32:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:21,992 INFO L225 Difference]: With dead ends: 1597 [2018-11-18 11:32:21,992 INFO L226 Difference]: Without dead ends: 1595 [2018-11-18 11:32:21,993 INFO L604 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-11-18 11:32:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-18 11:32:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1289. [2018-11-18 11:32:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-18 11:32:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2103 transitions. [2018-11-18 11:32:22,028 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2103 transitions. Word has length 28 [2018-11-18 11:32:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:22,029 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2103 transitions. [2018-11-18 11:32:22,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2103 transitions. [2018-11-18 11:32:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 11:32:22,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:22,030 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:22,030 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:22,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:22,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1233273980, now seen corresponding path program 1 times [2018-11-18 11:32:22,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:22,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:22,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:22,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:22,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:22,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:22,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:22,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:22,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:22,059 INFO L87 Difference]: Start difference. First operand 1289 states and 2103 transitions. Second operand 3 states. [2018-11-18 11:32:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:22,097 INFO L93 Difference]: Finished difference Result 2365 states and 3929 transitions. [2018-11-18 11:32:22,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:22,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 11:32:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:22,104 INFO L225 Difference]: With dead ends: 2365 [2018-11-18 11:32:22,104 INFO L226 Difference]: Without dead ends: 2363 [2018-11-18 11:32:22,105 INFO L604 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-11-18 11:32:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2018-11-18 11:32:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1817. [2018-11-18 11:32:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2018-11-18 11:32:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2903 transitions. [2018-11-18 11:32:22,153 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2903 transitions. Word has length 29 [2018-11-18 11:32:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:22,153 INFO L480 AbstractCegarLoop]: Abstraction has 1817 states and 2903 transitions. [2018-11-18 11:32:22,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2903 transitions. [2018-11-18 11:32:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 11:32:22,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:22,155 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:22,155 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:22,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:22,156 INFO L82 PathProgramCache]: Analyzing trace with hash 212205626, now seen corresponding path program 1 times [2018-11-18 11:32:22,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:22,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:22,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:22,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:22,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:22,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:22,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:22,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:22,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:22,185 INFO L87 Difference]: Start difference. First operand 1817 states and 2903 transitions. Second operand 3 states. [2018-11-18 11:32:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:22,235 INFO L93 Difference]: Finished difference Result 4317 states and 6937 transitions. [2018-11-18 11:32:22,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:22,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 11:32:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:22,242 INFO L225 Difference]: With dead ends: 4317 [2018-11-18 11:32:22,242 INFO L226 Difference]: Without dead ends: 2523 [2018-11-18 11:32:22,245 INFO L604 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-11-18 11:32:22,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-11-18 11:32:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2521. [2018-11-18 11:32:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2018-11-18 11:32:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4007 transitions. [2018-11-18 11:32:22,313 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4007 transitions. Word has length 29 [2018-11-18 11:32:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:22,313 INFO L480 AbstractCegarLoop]: Abstraction has 2521 states and 4007 transitions. [2018-11-18 11:32:22,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4007 transitions. [2018-11-18 11:32:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:32:22,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:22,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:22,316 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:22,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:22,316 INFO L82 PathProgramCache]: Analyzing trace with hash -422998170, now seen corresponding path program 1 times [2018-11-18 11:32:22,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:22,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:22,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:22,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:22,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:22,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:22,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:22,331 INFO L87 Difference]: Start difference. First operand 2521 states and 4007 transitions. Second operand 3 states. [2018-11-18 11:32:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:22,415 INFO L93 Difference]: Finished difference Result 3805 states and 6041 transitions. [2018-11-18 11:32:22,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:22,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 11:32:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:22,423 INFO L225 Difference]: With dead ends: 3805 [2018-11-18 11:32:22,424 INFO L226 Difference]: Without dead ends: 2571 [2018-11-18 11:32:22,426 INFO L604 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-11-18 11:32:22,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2018-11-18 11:32:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2569. [2018-11-18 11:32:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2018-11-18 11:32:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4039 transitions. [2018-11-18 11:32:22,484 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4039 transitions. Word has length 30 [2018-11-18 11:32:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:22,485 INFO L480 AbstractCegarLoop]: Abstraction has 2569 states and 4039 transitions. [2018-11-18 11:32:22,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4039 transitions. [2018-11-18 11:32:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:32:22,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:22,487 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:22,487 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:22,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2011346072, now seen corresponding path program 1 times [2018-11-18 11:32:22,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:22,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:22,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:22,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:22,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:22,511 INFO L87 Difference]: Start difference. First operand 2569 states and 4039 transitions. Second operand 3 states. [2018-11-18 11:32:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:22,565 INFO L93 Difference]: Finished difference Result 4621 states and 7401 transitions. [2018-11-18 11:32:22,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:22,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 11:32:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:22,577 INFO L225 Difference]: With dead ends: 4621 [2018-11-18 11:32:22,577 INFO L226 Difference]: Without dead ends: 4619 [2018-11-18 11:32:22,578 INFO L604 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-11-18 11:32:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-18 11:32:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 3657. [2018-11-18 11:32:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-11-18 11:32:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 5607 transitions. [2018-11-18 11:32:22,661 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 5607 transitions. Word has length 30 [2018-11-18 11:32:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:22,661 INFO L480 AbstractCegarLoop]: Abstraction has 3657 states and 5607 transitions. [2018-11-18 11:32:22,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 5607 transitions. [2018-11-18 11:32:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:32:22,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:22,665 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:22,665 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:22,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:22,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1262552870, now seen corresponding path program 1 times [2018-11-18 11:32:22,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:22,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:22,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:22,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:22,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:22,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:22,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:22,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:22,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:22,683 INFO L87 Difference]: Start difference. First operand 3657 states and 5607 transitions. Second operand 3 states. [2018-11-18 11:32:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:22,767 INFO L93 Difference]: Finished difference Result 8589 states and 13225 transitions. [2018-11-18 11:32:22,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:22,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 11:32:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:22,780 INFO L225 Difference]: With dead ends: 8589 [2018-11-18 11:32:22,780 INFO L226 Difference]: Without dead ends: 5003 [2018-11-18 11:32:22,785 INFO L604 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-11-18 11:32:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-11-18 11:32:22,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 5001. [2018-11-18 11:32:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5001 states. [2018-11-18 11:32:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 7623 transitions. [2018-11-18 11:32:22,893 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 7623 transitions. Word has length 30 [2018-11-18 11:32:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:22,894 INFO L480 AbstractCegarLoop]: Abstraction has 5001 states and 7623 transitions. [2018-11-18 11:32:22,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 7623 transitions. [2018-11-18 11:32:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:32:22,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:22,898 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:22,898 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:22,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2072995663, now seen corresponding path program 1 times [2018-11-18 11:32:22,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:22,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:22,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:22,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:22,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:22,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:22,914 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:22,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:22,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:22,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:22,915 INFO L87 Difference]: Start difference. First operand 5001 states and 7623 transitions. Second operand 3 states. [2018-11-18 11:32:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:22,995 INFO L93 Difference]: Finished difference Result 7501 states and 11401 transitions. [2018-11-18 11:32:22,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:22,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 11:32:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:23,003 INFO L225 Difference]: With dead ends: 7501 [2018-11-18 11:32:23,003 INFO L226 Difference]: Without dead ends: 5067 [2018-11-18 11:32:23,007 INFO L604 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-11-18 11:32:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-11-18 11:32:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5065. [2018-11-18 11:32:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5065 states. [2018-11-18 11:32:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 7623 transitions. [2018-11-18 11:32:23,121 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 7623 transitions. Word has length 31 [2018-11-18 11:32:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:23,121 INFO L480 AbstractCegarLoop]: Abstraction has 5065 states and 7623 transitions. [2018-11-18 11:32:23,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 7623 transitions. [2018-11-18 11:32:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:32:23,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:23,125 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:23,125 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:23,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:23,126 INFO L82 PathProgramCache]: Analyzing trace with hash 484647761, now seen corresponding path program 1 times [2018-11-18 11:32:23,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:23,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:23,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:23,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:23,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:23,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:23,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:23,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:23,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:23,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:23,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:23,143 INFO L87 Difference]: Start difference. First operand 5065 states and 7623 transitions. Second operand 3 states. [2018-11-18 11:32:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:23,251 INFO L93 Difference]: Finished difference Result 8973 states and 13769 transitions. [2018-11-18 11:32:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:23,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 11:32:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:23,266 INFO L225 Difference]: With dead ends: 8973 [2018-11-18 11:32:23,266 INFO L226 Difference]: Without dead ends: 8971 [2018-11-18 11:32:23,269 INFO L604 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-11-18 11:32:23,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2018-11-18 11:32:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 7305. [2018-11-18 11:32:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7305 states. [2018-11-18 11:32:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 10695 transitions. [2018-11-18 11:32:23,436 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 10695 transitions. Word has length 31 [2018-11-18 11:32:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:23,436 INFO L480 AbstractCegarLoop]: Abstraction has 7305 states and 10695 transitions. [2018-11-18 11:32:23,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 10695 transitions. [2018-11-18 11:32:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:32:23,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:23,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:23,445 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:23,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:23,446 INFO L82 PathProgramCache]: Analyzing trace with hash -536420593, now seen corresponding path program 1 times [2018-11-18 11:32:23,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:23,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:23,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:23,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:23,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:23,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:23,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:23,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:23,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:23,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:23,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:23,463 INFO L87 Difference]: Start difference. First operand 7305 states and 10695 transitions. Second operand 3 states. [2018-11-18 11:32:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:23,624 INFO L93 Difference]: Finished difference Result 17037 states and 25033 transitions. [2018-11-18 11:32:23,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:23,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 11:32:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:23,640 INFO L225 Difference]: With dead ends: 17037 [2018-11-18 11:32:23,640 INFO L226 Difference]: Without dead ends: 9867 [2018-11-18 11:32:23,650 INFO L604 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-11-18 11:32:23,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2018-11-18 11:32:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9865. [2018-11-18 11:32:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9865 states. [2018-11-18 11:32:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9865 states to 9865 states and 14343 transitions. [2018-11-18 11:32:23,835 INFO L78 Accepts]: Start accepts. Automaton has 9865 states and 14343 transitions. Word has length 31 [2018-11-18 11:32:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:23,835 INFO L480 AbstractCegarLoop]: Abstraction has 9865 states and 14343 transitions. [2018-11-18 11:32:23,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 9865 states and 14343 transitions. [2018-11-18 11:32:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:32:23,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:23,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:23,843 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:23,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:23,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2139393499, now seen corresponding path program 1 times [2018-11-18 11:32:23,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:23,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:23,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:23,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:23,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:23,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:23,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:23,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:23,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:23,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:23,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:23,871 INFO L87 Difference]: Start difference. First operand 9865 states and 14343 transitions. Second operand 3 states. [2018-11-18 11:32:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:23,996 INFO L93 Difference]: Finished difference Result 14797 states and 21449 transitions. [2018-11-18 11:32:23,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:23,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 11:32:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:24,012 INFO L225 Difference]: With dead ends: 14797 [2018-11-18 11:32:24,012 INFO L226 Difference]: Without dead ends: 9995 [2018-11-18 11:32:24,020 INFO L604 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-11-18 11:32:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9995 states. [2018-11-18 11:32:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9995 to 9993. [2018-11-18 11:32:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9993 states. [2018-11-18 11:32:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9993 states to 9993 states and 14343 transitions. [2018-11-18 11:32:24,189 INFO L78 Accepts]: Start accepts. Automaton has 9993 states and 14343 transitions. Word has length 32 [2018-11-18 11:32:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:24,189 INFO L480 AbstractCegarLoop]: Abstraction has 9993 states and 14343 transitions. [2018-11-18 11:32:24,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 9993 states and 14343 transitions. [2018-11-18 11:32:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:32:24,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:24,195 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:24,195 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:24,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:24,195 INFO L82 PathProgramCache]: Analyzing trace with hash 551045597, now seen corresponding path program 1 times [2018-11-18 11:32:24,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:24,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:24,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:24,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:24,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:24,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:24,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:24,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:24,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:24,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:24,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:24,220 INFO L87 Difference]: Start difference. First operand 9993 states and 14343 transitions. Second operand 3 states. [2018-11-18 11:32:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:24,398 INFO L93 Difference]: Finished difference Result 17421 states and 25481 transitions. [2018-11-18 11:32:24,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:24,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 11:32:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:24,419 INFO L225 Difference]: With dead ends: 17421 [2018-11-18 11:32:24,420 INFO L226 Difference]: Without dead ends: 17419 [2018-11-18 11:32:24,425 INFO L604 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-11-18 11:32:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2018-11-18 11:32:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 14601. [2018-11-18 11:32:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14601 states. [2018-11-18 11:32:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 20359 transitions. [2018-11-18 11:32:24,668 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 20359 transitions. Word has length 32 [2018-11-18 11:32:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:24,668 INFO L480 AbstractCegarLoop]: Abstraction has 14601 states and 20359 transitions. [2018-11-18 11:32:24,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 20359 transitions. [2018-11-18 11:32:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:32:24,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:24,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:24,675 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:24,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash -470022757, now seen corresponding path program 1 times [2018-11-18 11:32:24,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:24,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:24,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:24,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:24,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:24,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:24,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:24,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:24,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:24,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:24,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:24,694 INFO L87 Difference]: Start difference. First operand 14601 states and 20359 transitions. Second operand 3 states. [2018-11-18 11:32:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:24,841 INFO L93 Difference]: Finished difference Result 33805 states and 47241 transitions. [2018-11-18 11:32:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:24,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 11:32:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:24,855 INFO L225 Difference]: With dead ends: 33805 [2018-11-18 11:32:24,855 INFO L226 Difference]: Without dead ends: 19467 [2018-11-18 11:32:24,865 INFO L604 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-11-18 11:32:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19467 states. [2018-11-18 11:32:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19467 to 19465. [2018-11-18 11:32:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19465 states. [2018-11-18 11:32:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19465 states to 19465 states and 26887 transitions. [2018-11-18 11:32:25,079 INFO L78 Accepts]: Start accepts. Automaton has 19465 states and 26887 transitions. Word has length 32 [2018-11-18 11:32:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:25,079 INFO L480 AbstractCegarLoop]: Abstraction has 19465 states and 26887 transitions. [2018-11-18 11:32:25,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 19465 states and 26887 transitions. [2018-11-18 11:32:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 11:32:25,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:25,085 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:25,086 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:25,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:25,086 INFO L82 PathProgramCache]: Analyzing trace with hash -97240540, now seen corresponding path program 1 times [2018-11-18 11:32:25,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:25,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:25,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:25,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:25,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:25,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:25,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:25,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:25,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:25,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:25,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:25,103 INFO L87 Difference]: Start difference. First operand 19465 states and 26887 transitions. Second operand 3 states. [2018-11-18 11:32:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:25,302 INFO L93 Difference]: Finished difference Result 29197 states and 40201 transitions. [2018-11-18 11:32:25,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:25,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 11:32:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:25,316 INFO L225 Difference]: With dead ends: 29197 [2018-11-18 11:32:25,316 INFO L226 Difference]: Without dead ends: 19723 [2018-11-18 11:32:25,322 INFO L604 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-11-18 11:32:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19723 states. [2018-11-18 11:32:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19723 to 19721. [2018-11-18 11:32:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19721 states. [2018-11-18 11:32:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19721 states to 19721 states and 26887 transitions. [2018-11-18 11:32:25,536 INFO L78 Accepts]: Start accepts. Automaton has 19721 states and 26887 transitions. Word has length 33 [2018-11-18 11:32:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:25,536 INFO L480 AbstractCegarLoop]: Abstraction has 19721 states and 26887 transitions. [2018-11-18 11:32:25,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 19721 states and 26887 transitions. [2018-11-18 11:32:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 11:32:25,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:25,542 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:25,543 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:25,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1685588442, now seen corresponding path program 1 times [2018-11-18 11:32:25,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:25,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:25,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:25,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:25,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:25,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:25,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:25,562 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:25,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:25,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:25,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:25,562 INFO L87 Difference]: Start difference. First operand 19721 states and 26887 transitions. Second operand 3 states. [2018-11-18 11:32:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:25,780 INFO L93 Difference]: Finished difference Result 33805 states and 46857 transitions. [2018-11-18 11:32:25,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:25,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 11:32:25,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:25,803 INFO L225 Difference]: With dead ends: 33805 [2018-11-18 11:32:25,803 INFO L226 Difference]: Without dead ends: 33803 [2018-11-18 11:32:25,808 INFO L604 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-11-18 11:32:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33803 states. [2018-11-18 11:32:26,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33803 to 29193. [2018-11-18 11:32:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29193 states. [2018-11-18 11:32:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29193 states to 29193 states and 38663 transitions. [2018-11-18 11:32:26,218 INFO L78 Accepts]: Start accepts. Automaton has 29193 states and 38663 transitions. Word has length 33 [2018-11-18 11:32:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:26,218 INFO L480 AbstractCegarLoop]: Abstraction has 29193 states and 38663 transitions. [2018-11-18 11:32:26,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 29193 states and 38663 transitions. [2018-11-18 11:32:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 11:32:26,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:26,228 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:26,229 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:26,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:26,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1588310500, now seen corresponding path program 1 times [2018-11-18 11:32:26,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:26,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:26,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:26,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:26,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:26,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:26,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:26,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:26,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:26,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:26,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:26,259 INFO L87 Difference]: Start difference. First operand 29193 states and 38663 transitions. Second operand 3 states. [2018-11-18 11:32:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:26,571 INFO L93 Difference]: Finished difference Result 67085 states and 88841 transitions. [2018-11-18 11:32:26,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:26,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 11:32:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:26,596 INFO L225 Difference]: With dead ends: 67085 [2018-11-18 11:32:26,596 INFO L226 Difference]: Without dead ends: 38411 [2018-11-18 11:32:26,620 INFO L604 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-11-18 11:32:26,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38411 states. [2018-11-18 11:32:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38411 to 38409. [2018-11-18 11:32:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38409 states. [2018-11-18 11:32:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38409 states to 38409 states and 50183 transitions. [2018-11-18 11:32:27,173 INFO L78 Accepts]: Start accepts. Automaton has 38409 states and 50183 transitions. Word has length 33 [2018-11-18 11:32:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:27,174 INFO L480 AbstractCegarLoop]: Abstraction has 38409 states and 50183 transitions. [2018-11-18 11:32:27,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 38409 states and 50183 transitions. [2018-11-18 11:32:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 11:32:27,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:27,185 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:27,185 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:27,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:27,185 INFO L82 PathProgramCache]: Analyzing trace with hash -713418672, now seen corresponding path program 1 times [2018-11-18 11:32:27,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:27,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:27,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:27,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:27,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:27,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:27,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:27,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:27,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:27,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:27,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:27,215 INFO L87 Difference]: Start difference. First operand 38409 states and 50183 transitions. Second operand 3 states. [2018-11-18 11:32:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:27,490 INFO L93 Difference]: Finished difference Result 57613 states and 75017 transitions. [2018-11-18 11:32:27,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:27,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 11:32:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:27,515 INFO L225 Difference]: With dead ends: 57613 [2018-11-18 11:32:27,515 INFO L226 Difference]: Without dead ends: 38923 [2018-11-18 11:32:27,527 INFO L604 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-11-18 11:32:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38923 states. [2018-11-18 11:32:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38923 to 38921. [2018-11-18 11:32:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38921 states. [2018-11-18 11:32:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38921 states to 38921 states and 50183 transitions. [2018-11-18 11:32:27,990 INFO L78 Accepts]: Start accepts. Automaton has 38921 states and 50183 transitions. Word has length 34 [2018-11-18 11:32:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:27,990 INFO L480 AbstractCegarLoop]: Abstraction has 38921 states and 50183 transitions. [2018-11-18 11:32:27,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 38921 states and 50183 transitions. [2018-11-18 11:32:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 11:32:28,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:28,005 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:28,005 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:28,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1993200722, now seen corresponding path program 1 times [2018-11-18 11:32:28,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:28,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:28,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:28,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:28,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:28,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:28,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:28,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:28,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:28,031 INFO L87 Difference]: Start difference. First operand 38921 states and 50183 transitions. Second operand 3 states. [2018-11-18 11:32:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:28,699 INFO L93 Difference]: Finished difference Result 65549 states and 85513 transitions. [2018-11-18 11:32:28,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:28,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 11:32:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:28,732 INFO L225 Difference]: With dead ends: 65549 [2018-11-18 11:32:28,732 INFO L226 Difference]: Without dead ends: 65547 [2018-11-18 11:32:28,738 INFO L604 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-11-18 11:32:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65547 states. [2018-11-18 11:32:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65547 to 58377. [2018-11-18 11:32:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58377 states. [2018-11-18 11:32:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58377 states to 58377 states and 73223 transitions. [2018-11-18 11:32:29,291 INFO L78 Accepts]: Start accepts. Automaton has 58377 states and 73223 transitions. Word has length 34 [2018-11-18 11:32:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:29,291 INFO L480 AbstractCegarLoop]: Abstraction has 58377 states and 73223 transitions. [2018-11-18 11:32:29,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 58377 states and 73223 transitions. [2018-11-18 11:32:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 11:32:29,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:29,320 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:29,320 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:29,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:29,320 INFO L82 PathProgramCache]: Analyzing trace with hash 972132368, now seen corresponding path program 1 times [2018-11-18 11:32:29,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:29,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:29,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:29,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:29,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:29,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:29,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:29,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:29,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:29,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:29,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:29,342 INFO L87 Difference]: Start difference. First operand 58377 states and 73223 transitions. Second operand 3 states. [2018-11-18 11:32:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:30,139 INFO L93 Difference]: Finished difference Result 133133 states and 166409 transitions. [2018-11-18 11:32:30,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:30,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 11:32:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:30,186 INFO L225 Difference]: With dead ends: 133133 [2018-11-18 11:32:30,186 INFO L226 Difference]: Without dead ends: 75787 [2018-11-18 11:32:30,214 INFO L604 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-11-18 11:32:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75787 states. [2018-11-18 11:32:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75787 to 75785. [2018-11-18 11:32:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75785 states. [2018-11-18 11:32:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75785 states to 75785 states and 93191 transitions. [2018-11-18 11:32:31,084 INFO L78 Accepts]: Start accepts. Automaton has 75785 states and 93191 transitions. Word has length 34 [2018-11-18 11:32:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:31,084 INFO L480 AbstractCegarLoop]: Abstraction has 75785 states and 93191 transitions. [2018-11-18 11:32:31,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 75785 states and 93191 transitions. [2018-11-18 11:32:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 11:32:31,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:31,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:31,113 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:31,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:31,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1659896057, now seen corresponding path program 1 times [2018-11-18 11:32:31,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:31,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:31,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:31,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:31,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:31,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:31,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:31,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:31,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:31,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:31,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:31,140 INFO L87 Difference]: Start difference. First operand 75785 states and 93191 transitions. Second operand 3 states. [2018-11-18 11:32:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:32,014 INFO L93 Difference]: Finished difference Result 113677 states and 139273 transitions. [2018-11-18 11:32:32,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:32,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 11:32:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:32,063 INFO L225 Difference]: With dead ends: 113677 [2018-11-18 11:32:32,063 INFO L226 Difference]: Without dead ends: 76811 [2018-11-18 11:32:32,083 INFO L604 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-11-18 11:32:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76811 states. [2018-11-18 11:32:32,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76811 to 76809. [2018-11-18 11:32:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76809 states. [2018-11-18 11:32:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76809 states to 76809 states and 93191 transitions. [2018-11-18 11:32:32,990 INFO L78 Accepts]: Start accepts. Automaton has 76809 states and 93191 transitions. Word has length 35 [2018-11-18 11:32:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:32,990 INFO L480 AbstractCegarLoop]: Abstraction has 76809 states and 93191 transitions. [2018-11-18 11:32:32,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 76809 states and 93191 transitions. [2018-11-18 11:32:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 11:32:33,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:33,011 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:33,012 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:33,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:33,012 INFO L82 PathProgramCache]: Analyzing trace with hash 71548155, now seen corresponding path program 1 times [2018-11-18 11:32:33,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:33,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:33,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:33,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:33,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:33,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:33,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:33,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:33,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:33,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:33,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:33,045 INFO L87 Difference]: Start difference. First operand 76809 states and 93191 transitions. Second operand 3 states. [2018-11-18 11:32:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:34,213 INFO L93 Difference]: Finished difference Result 126989 states and 154633 transitions. [2018-11-18 11:32:34,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:34,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 11:32:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:34,291 INFO L225 Difference]: With dead ends: 126989 [2018-11-18 11:32:34,291 INFO L226 Difference]: Without dead ends: 126987 [2018-11-18 11:32:34,303 INFO L604 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-11-18 11:32:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126987 states. [2018-11-18 11:32:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126987 to 116745. [2018-11-18 11:32:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116745 states. [2018-11-18 11:32:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116745 states to 116745 states and 138247 transitions. [2018-11-18 11:32:35,526 INFO L78 Accepts]: Start accepts. Automaton has 116745 states and 138247 transitions. Word has length 35 [2018-11-18 11:32:35,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:35,526 INFO L480 AbstractCegarLoop]: Abstraction has 116745 states and 138247 transitions. [2018-11-18 11:32:35,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 116745 states and 138247 transitions. [2018-11-18 11:32:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 11:32:35,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:35,586 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:35,586 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:35,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:35,586 INFO L82 PathProgramCache]: Analyzing trace with hash -949520199, now seen corresponding path program 1 times [2018-11-18 11:32:35,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:35,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:35,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:35,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:35,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:35,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:35,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:35,608 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:35,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:35,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:35,608 INFO L87 Difference]: Start difference. First operand 116745 states and 138247 transitions. Second operand 3 states. [2018-11-18 11:32:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:37,104 INFO L93 Difference]: Finished difference Result 264205 states and 310281 transitions. [2018-11-18 11:32:37,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:37,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 11:32:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:37,205 INFO L225 Difference]: With dead ends: 264205 [2018-11-18 11:32:37,205 INFO L226 Difference]: Without dead ends: 149515 [2018-11-18 11:32:37,266 INFO L604 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-11-18 11:32:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149515 states. [2018-11-18 11:32:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149515 to 149513. [2018-11-18 11:32:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149513 states. [2018-11-18 11:32:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149513 states to 149513 states and 172039 transitions. [2018-11-18 11:32:39,336 INFO L78 Accepts]: Start accepts. Automaton has 149513 states and 172039 transitions. Word has length 35 [2018-11-18 11:32:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:39,336 INFO L480 AbstractCegarLoop]: Abstraction has 149513 states and 172039 transitions. [2018-11-18 11:32:39,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 149513 states and 172039 transitions. [2018-11-18 11:32:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 11:32:39,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:39,386 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:39,386 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:39,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:39,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2076758331, now seen corresponding path program 1 times [2018-11-18 11:32:39,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:39,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:39,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:39,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:39,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:39,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:39,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:39,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:39,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:39,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:39,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:39,418 INFO L87 Difference]: Start difference. First operand 149513 states and 172039 transitions. Second operand 3 states. [2018-11-18 11:32:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:40,683 INFO L93 Difference]: Finished difference Result 224269 states and 257033 transitions. [2018-11-18 11:32:40,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:40,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 11:32:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:40,841 INFO L225 Difference]: With dead ends: 224269 [2018-11-18 11:32:40,841 INFO L226 Difference]: Without dead ends: 151563 [2018-11-18 11:32:40,909 INFO L604 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-11-18 11:32:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151563 states. [2018-11-18 11:32:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151563 to 151561. [2018-11-18 11:32:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151561 states. [2018-11-18 11:32:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151561 states to 151561 states and 172039 transitions. [2018-11-18 11:32:45,024 INFO L78 Accepts]: Start accepts. Automaton has 151561 states and 172039 transitions. Word has length 36 [2018-11-18 11:32:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:45,025 INFO L480 AbstractCegarLoop]: Abstraction has 151561 states and 172039 transitions. [2018-11-18 11:32:45,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 151561 states and 172039 transitions. [2018-11-18 11:32:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 11:32:45,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:45,077 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:45,077 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:45,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash 629861063, now seen corresponding path program 1 times [2018-11-18 11:32:45,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:45,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:45,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:45,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:45,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:45,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:45,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:45,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:45,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:45,111 INFO L87 Difference]: Start difference. First operand 151561 states and 172039 transitions. Second operand 3 states. [2018-11-18 11:32:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:47,570 INFO L93 Difference]: Finished difference Result 442379 states and 491528 transitions. [2018-11-18 11:32:47,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:47,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 11:32:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:47,703 INFO L225 Difference]: With dead ends: 442379 [2018-11-18 11:32:47,703 INFO L226 Difference]: Without dead ends: 151561 [2018-11-18 11:32:47,839 INFO L604 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-11-18 11:32:47,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151561 states. [2018-11-18 11:32:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151561 to 151561. [2018-11-18 11:32:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151561 states. [2018-11-18 11:32:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151561 states to 151561 states and 163847 transitions. [2018-11-18 11:32:50,088 INFO L78 Accepts]: Start accepts. Automaton has 151561 states and 163847 transitions. Word has length 36 [2018-11-18 11:32:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:50,089 INFO L480 AbstractCegarLoop]: Abstraction has 151561 states and 163847 transitions. [2018-11-18 11:32:50,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 151561 states and 163847 transitions. [2018-11-18 11:32:50,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 11:32:50,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:32:50,138 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:32:50,138 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:32:50,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:32:50,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1650929417, now seen corresponding path program 1 times [2018-11-18 11:32:50,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:32:50,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:50,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:32:50,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:32:50,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:32:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:32:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:32:50,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:32:50,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:32:50,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:32:50,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:32:50,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:32:50,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:32:50,154 INFO L87 Difference]: Start difference. First operand 151561 states and 163847 transitions. Second operand 3 states. [2018-11-18 11:32:51,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:32:51,262 INFO L93 Difference]: Finished difference Result 151561 states and 163847 transitions. [2018-11-18 11:32:51,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:32:51,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 11:32:51,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:32:51,262 INFO L225 Difference]: With dead ends: 151561 [2018-11-18 11:32:51,262 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 11:32:51,331 INFO L604 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-11-18 11:32:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 11:32:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 11:32:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 11:32:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 11:32:51,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-18 11:32:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:32:51,332 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:32:51,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:32:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:32:51,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 11:32:51,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 11:32:51,379 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:32:51,379 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 11:32:51,379 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,379 INFO L428 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-18 11:32:51,379 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L425 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,380 INFO L428 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L421 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,381 INFO L425 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 11:32:51,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:32:51 BoogieIcfgContainer [2018-11-18 11:32:51,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:32:51,387 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:32:51,387 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:32:51,387 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:32:51,388 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:32:20" (3/4) ... [2018-11-18 11:32:51,391 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 11:32:51,397 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 11:32:51,397 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 11:32:51,401 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 11:32:51,401 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 11:32:51,401 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 11:32:51,446 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8ce0d62b-6f9c-4816-8050-7d08217370c4/bin-2019/utaipan/witness.graphml [2018-11-18 11:32:51,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:32:51,446 INFO L168 Benchmark]: Toolchain (without parser) took 31176.12 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 953.8 MB in the beginning and 1.7 GB in the end (delta: -732.0 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-11-18 11:32:51,448 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:32:51,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.06 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:32:51,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.82 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:32:51,449 INFO L168 Benchmark]: Boogie Preprocessor took 51.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -203.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:32:51,449 INFO L168 Benchmark]: RCFGBuilder took 236.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:32:51,449 INFO L168 Benchmark]: TraceAbstraction took 30640.08 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -569.5 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-11-18 11:32:51,449 INFO L168 Benchmark]: Witness Printer took 58.70 ms. Allocated memory is still 5.4 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:32:51,451 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.06 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.82 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -203.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 236.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30640.08 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -569.5 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 58.70 ms. Allocated memory is still 5.4 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 1 error locations. SAFE Result, 30.5s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 13.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4036 SDtfs, 2016 SDslu, 2748 SDs, 0 SdLazy, 195 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151561occurred in iteration=35, 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: 15.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 28711 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8202 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 1117 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1080 ConstructedInterpolants, 0 QuantifiedInterpolants, 65104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...