./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/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_0b78b234-d24f-48e1-89dd-30b33bd5c896/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/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-1dbac8b [2018-11-10 10:23:55,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:23:55,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:23:55,886 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:23:55,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:23:55,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:23:55,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:23:55,889 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:23:55,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:23:55,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:23:55,891 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:23:55,891 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:23:55,892 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:23:55,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:23:55,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:23:55,893 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:23:55,894 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:23:55,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:23:55,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:23:55,897 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:23:55,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:23:55,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:23:55,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:23:55,900 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:23:55,901 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:23:55,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:23:55,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:23:55,902 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:23:55,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:23:55,904 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:23:55,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:23:55,904 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:23:55,905 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:23:55,905 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:23:55,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:23:55,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:23:55,906 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 10:23:55,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:23:55,916 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:23:55,917 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:23:55,917 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:23:55,917 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:23:55,917 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:23:55,917 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 10:23:55,918 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:23:55,918 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 10:23:55,918 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 10:23:55,918 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:23:55,918 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:23:55,919 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:23:55,919 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:23:55,919 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:23:55,919 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:23:55,919 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:23:55,919 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:23:55,919 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:23:55,919 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:23:55,920 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:23:55,920 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:23:55,920 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:23:55,920 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:23:55,920 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:23:55,920 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:23:55,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:23:55,921 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:23:55,921 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:23:55,921 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:23:55,921 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 10:23:55,921 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:23:55,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:23:55,921 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 10:23:55,921 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_0b78b234-d24f-48e1-89dd-30b33bd5c896/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-10 10:23:55,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:23:55,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:23:55,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:23:55,958 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:23:55,959 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:23:55,959 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 10:23:55,994 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/bin-2019/utaipan/data/ebe370fec/632bf6e6436b4789a75752a9af03bfd9/FLAG72daa21c4 [2018-11-10 10:23:56,394 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:23:56,395 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 10:23:56,401 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/bin-2019/utaipan/data/ebe370fec/632bf6e6436b4789a75752a9af03bfd9/FLAG72daa21c4 [2018-11-10 10:23:56,410 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/bin-2019/utaipan/data/ebe370fec/632bf6e6436b4789a75752a9af03bfd9 [2018-11-10 10:23:56,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:23:56,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:23:56,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:23:56,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:23:56,418 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:23:56,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:23:56" (1/1) ... [2018-11-10 10:23:56,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27bb5729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56, skipping insertion in model container [2018-11-10 10:23:56,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:23:56" (1/1) ... [2018-11-10 10:23:56,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:23:56,447 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:23:56,565 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:23:56,568 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:23:56,584 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:23:56,592 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:23:56,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56 WrapperNode [2018-11-10 10:23:56,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:23:56,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:23:56,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:23:56,593 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:23:56,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56" (1/1) ... [2018-11-10 10:23:56,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56" (1/1) ... [2018-11-10 10:23:56,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:23:56,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:23:56,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:23:56,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:23:56,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56" (1/1) ... [2018-11-10 10:23:56,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56" (1/1) ... [2018-11-10 10:23:56,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56" (1/1) ... [2018-11-10 10:23:56,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56" (1/1) ... [2018-11-10 10:23:56,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56" (1/1) ... [2018-11-10 10:23:56,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56" (1/1) ... [2018-11-10 10:23:56,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56" (1/1) ... [2018-11-10 10:23:56,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:23:56,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:23:56,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:23:56,626 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:23:56,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/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-10 10:23:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:23:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:23:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:23:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:23:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:23:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:23:56,876 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:23:56,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:23:56 BoogieIcfgContainer [2018-11-10 10:23:56,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:23:56,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:23:56,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:23:56,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:23:56,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:23:56" (1/3) ... [2018-11-10 10:23:56,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b6adb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:23:56, skipping insertion in model container [2018-11-10 10:23:56,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:23:56" (2/3) ... [2018-11-10 10:23:56,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b6adb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:23:56, skipping insertion in model container [2018-11-10 10:23:56,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:23:56" (3/3) ... [2018-11-10 10:23:56,881 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 10:23:56,886 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:23:56,893 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:23:56,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:23:56,926 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:23:56,926 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:23:56,926 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:23:56,926 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:23:56,926 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:23:56,927 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:23:56,927 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:23:56,927 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:23:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-10 10:23:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 10:23:56,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:56,941 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-10 10:23:56,942 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:56,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:56,946 INFO L82 PathProgramCache]: Analyzing trace with hash -731061561, now seen corresponding path program 1 times [2018-11-10 10:23:56,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:56,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:56,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:56,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:56,977 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,079 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-10 10:23:57,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,080 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,095 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-11-10 10:23:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,134 INFO L93 Difference]: Finished difference Result 107 states and 188 transitions. [2018-11-10 10:23:57,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 10:23:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,145 INFO L225 Difference]: With dead ends: 107 [2018-11-10 10:23:57,145 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 10:23:57,147 INFO L605 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-10 10:23:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 10:23:57,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 63. [2018-11-10 10:23:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 10:23:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2018-11-10 10:23:57,174 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2018-11-10 10:23:57,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,174 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2018-11-10 10:23:57,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2018-11-10 10:23:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 10:23:57,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,175 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-10 10:23:57,175 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1752129915, now seen corresponding path program 1 times [2018-11-10 10:23:57,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,221 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-10 10:23:57,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,221 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,223 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand 3 states. [2018-11-10 10:23:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,260 INFO L93 Difference]: Finished difference Result 150 states and 275 transitions. [2018-11-10 10:23:57,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 10:23:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,262 INFO L225 Difference]: With dead ends: 150 [2018-11-10 10:23:57,262 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 10:23:57,262 INFO L605 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-10 10:23:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 10:23:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-10 10:23:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 10:23:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 163 transitions. [2018-11-10 10:23:57,268 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 163 transitions. Word has length 24 [2018-11-10 10:23:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,268 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 163 transitions. [2018-11-10 10:23:57,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2018-11-10 10:23:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 10:23:57,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,269 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-10 10:23:57,269 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1187859502, now seen corresponding path program 1 times [2018-11-10 10:23:57,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,306 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-10 10:23:57,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,306 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,307 INFO L87 Difference]: Start difference. First operand 90 states and 163 transitions. Second operand 3 states. [2018-11-10 10:23:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,318 INFO L93 Difference]: Finished difference Result 139 states and 247 transitions. [2018-11-10 10:23:57,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 10:23:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,319 INFO L225 Difference]: With dead ends: 139 [2018-11-10 10:23:57,319 INFO L226 Difference]: Without dead ends: 96 [2018-11-10 10:23:57,320 INFO L605 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-10 10:23:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-10 10:23:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-10 10:23:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 10:23:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 166 transitions. [2018-11-10 10:23:57,325 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 166 transitions. Word has length 25 [2018-11-10 10:23:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,325 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 166 transitions. [2018-11-10 10:23:57,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 166 transitions. [2018-11-10 10:23:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 10:23:57,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,326 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-10 10:23:57,326 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1518759892, now seen corresponding path program 1 times [2018-11-10 10:23:57,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,327 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,360 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-10 10:23:57,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,361 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,362 INFO L87 Difference]: Start difference. First operand 94 states and 166 transitions. Second operand 3 states. [2018-11-10 10:23:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,374 INFO L93 Difference]: Finished difference Result 177 states and 317 transitions. [2018-11-10 10:23:57,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 10:23:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,375 INFO L225 Difference]: With dead ends: 177 [2018-11-10 10:23:57,376 INFO L226 Difference]: Without dead ends: 175 [2018-11-10 10:23:57,376 INFO L605 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-10 10:23:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-10 10:23:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 123. [2018-11-10 10:23:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 10:23:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 219 transitions. [2018-11-10 10:23:57,384 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 219 transitions. Word has length 25 [2018-11-10 10:23:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,384 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 219 transitions. [2018-11-10 10:23:57,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 219 transitions. [2018-11-10 10:23:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 10:23:57,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,385 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-10 10:23:57,386 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash 497691538, now seen corresponding path program 1 times [2018-11-10 10:23:57,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,387 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,411 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-10 10:23:57,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,412 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,412 INFO L87 Difference]: Start difference. First operand 123 states and 219 transitions. Second operand 3 states. [2018-11-10 10:23:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,428 INFO L93 Difference]: Finished difference Result 291 states and 525 transitions. [2018-11-10 10:23:57,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 10:23:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,430 INFO L225 Difference]: With dead ends: 291 [2018-11-10 10:23:57,430 INFO L226 Difference]: Without dead ends: 177 [2018-11-10 10:23:57,431 INFO L605 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-10 10:23:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-10 10:23:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-11-10 10:23:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-10 10:23:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 311 transitions. [2018-11-10 10:23:57,438 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 311 transitions. Word has length 25 [2018-11-10 10:23:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,438 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 311 transitions. [2018-11-10 10:23:57,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 311 transitions. [2018-11-10 10:23:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:23:57,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,439 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-10 10:23:57,440 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash -162870854, now seen corresponding path program 1 times [2018-11-10 10:23:57,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,441 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,467 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-10 10:23:57,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,468 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,468 INFO L87 Difference]: Start difference. First operand 175 states and 311 transitions. Second operand 3 states. [2018-11-10 10:23:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,503 INFO L93 Difference]: Finished difference Result 262 states and 464 transitions. [2018-11-10 10:23:57,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 10:23:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,504 INFO L225 Difference]: With dead ends: 262 [2018-11-10 10:23:57,505 INFO L226 Difference]: Without dead ends: 179 [2018-11-10 10:23:57,505 INFO L605 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-10 10:23:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-10 10:23:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-11-10 10:23:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-10 10:23:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 311 transitions. [2018-11-10 10:23:57,513 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 311 transitions. Word has length 26 [2018-11-10 10:23:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,514 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 311 transitions. [2018-11-10 10:23:57,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 311 transitions. [2018-11-10 10:23:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:23:57,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,515 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-10 10:23:57,515 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1751218756, now seen corresponding path program 1 times [2018-11-10 10:23:57,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,516 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,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-10 10:23:57,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,561 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,562 INFO L87 Difference]: Start difference. First operand 177 states and 311 transitions. Second operand 3 states. [2018-11-10 10:23:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,581 INFO L93 Difference]: Finished difference Result 333 states and 593 transitions. [2018-11-10 10:23:57,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 10:23:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,583 INFO L225 Difference]: With dead ends: 333 [2018-11-10 10:23:57,583 INFO L226 Difference]: Without dead ends: 331 [2018-11-10 10:23:57,583 INFO L605 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-10 10:23:57,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-10 10:23:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 237. [2018-11-10 10:23:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-10 10:23:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 415 transitions. [2018-11-10 10:23:57,593 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 415 transitions. Word has length 26 [2018-11-10 10:23:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,593 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 415 transitions. [2018-11-10 10:23:57,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 415 transitions. [2018-11-10 10:23:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:23:57,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,594 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-10 10:23:57,595 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1522680186, now seen corresponding path program 1 times [2018-11-10 10:23:57,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,621 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-10 10:23:57,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,621 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,622 INFO L87 Difference]: Start difference. First operand 237 states and 415 transitions. Second operand 3 states. [2018-11-10 10:23:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,638 INFO L93 Difference]: Finished difference Result 565 states and 997 transitions. [2018-11-10 10:23:57,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 10:23:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,640 INFO L225 Difference]: With dead ends: 565 [2018-11-10 10:23:57,640 INFO L226 Difference]: Without dead ends: 339 [2018-11-10 10:23:57,641 INFO L605 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-10 10:23:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-10 10:23:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-11-10 10:23:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-10 10:23:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 587 transitions. [2018-11-10 10:23:57,650 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 587 transitions. Word has length 26 [2018-11-10 10:23:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,651 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 587 transitions. [2018-11-10 10:23:57,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 587 transitions. [2018-11-10 10:23:57,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:23:57,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,652 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-10 10:23:57,652 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1547006503, now seen corresponding path program 1 times [2018-11-10 10:23:57,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,653 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,677 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-10 10:23:57,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,678 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,679 INFO L87 Difference]: Start difference. First operand 337 states and 587 transitions. Second operand 3 states. [2018-11-10 10:23:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,691 INFO L93 Difference]: Finished difference Result 505 states and 877 transitions. [2018-11-10 10:23:57,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 10:23:57,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,693 INFO L225 Difference]: With dead ends: 505 [2018-11-10 10:23:57,693 INFO L226 Difference]: Without dead ends: 343 [2018-11-10 10:23:57,693 INFO L605 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-10 10:23:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-10 10:23:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-11-10 10:23:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-10 10:23:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 587 transitions. [2018-11-10 10:23:57,702 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 587 transitions. Word has length 27 [2018-11-10 10:23:57,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,703 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 587 transitions. [2018-11-10 10:23:57,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 587 transitions. [2018-11-10 10:23:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:23:57,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,704 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-10 10:23:57,704 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,704 INFO L82 PathProgramCache]: Analyzing trace with hash -41341399, now seen corresponding path program 1 times [2018-11-10 10:23:57,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,705 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,737 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-10 10:23:57,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,737 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,738 INFO L87 Difference]: Start difference. First operand 341 states and 587 transitions. Second operand 3 states. [2018-11-10 10:23:57,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,762 INFO L93 Difference]: Finished difference Result 637 states and 1113 transitions. [2018-11-10 10:23:57,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 10:23:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,765 INFO L225 Difference]: With dead ends: 637 [2018-11-10 10:23:57,765 INFO L226 Difference]: Without dead ends: 635 [2018-11-10 10:23:57,766 INFO L605 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-10 10:23:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-11-10 10:23:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 465. [2018-11-10 10:23:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-10 10:23:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 791 transitions. [2018-11-10 10:23:57,780 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 791 transitions. Word has length 27 [2018-11-10 10:23:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,780 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 791 transitions. [2018-11-10 10:23:57,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 791 transitions. [2018-11-10 10:23:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:23:57,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,781 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-10 10:23:57,781 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1062409753, now seen corresponding path program 1 times [2018-11-10 10:23:57,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,783 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,805 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-10 10:23:57,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,805 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,806 INFO L87 Difference]: Start difference. First operand 465 states and 791 transitions. Second operand 3 states. [2018-11-10 10:23:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,849 INFO L93 Difference]: Finished difference Result 1109 states and 1897 transitions. [2018-11-10 10:23:57,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 10:23:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,852 INFO L225 Difference]: With dead ends: 1109 [2018-11-10 10:23:57,852 INFO L226 Difference]: Without dead ends: 659 [2018-11-10 10:23:57,853 INFO L605 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-10 10:23:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-10 10:23:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2018-11-10 10:23:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-10 10:23:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1111 transitions. [2018-11-10 10:23:57,873 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1111 transitions. Word has length 27 [2018-11-10 10:23:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,873 INFO L481 AbstractCegarLoop]: Abstraction has 657 states and 1111 transitions. [2018-11-10 10:23:57,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1111 transitions. [2018-11-10 10:23:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:23:57,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,874 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-10 10:23:57,875 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1281369937, now seen corresponding path program 1 times [2018-11-10 10:23:57,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,878 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,897 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-10 10:23:57,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,897 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,898 INFO L87 Difference]: Start difference. First operand 657 states and 1111 transitions. Second operand 3 states. [2018-11-10 10:23:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:57,924 INFO L93 Difference]: Finished difference Result 985 states and 1661 transitions. [2018-11-10 10:23:57,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:57,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 10:23:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:57,928 INFO L225 Difference]: With dead ends: 985 [2018-11-10 10:23:57,928 INFO L226 Difference]: Without dead ends: 667 [2018-11-10 10:23:57,929 INFO L605 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-10 10:23:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-10 10:23:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2018-11-10 10:23:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-10 10:23:57,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1111 transitions. [2018-11-10 10:23:57,947 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1111 transitions. Word has length 28 [2018-11-10 10:23:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:57,947 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 1111 transitions. [2018-11-10 10:23:57,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:57,947 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1111 transitions. [2018-11-10 10:23:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:23:57,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:57,948 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-10 10:23:57,948 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:57,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1425249457, now seen corresponding path program 1 times [2018-11-10 10:23:57,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:57,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:57,950 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:57,970 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-10 10:23:57,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:57,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:57,970 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:57,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:57,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:57,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:57,971 INFO L87 Difference]: Start difference. First operand 665 states and 1111 transitions. Second operand 3 states. [2018-11-10 10:23:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:58,010 INFO L93 Difference]: Finished difference Result 1933 states and 3225 transitions. [2018-11-10 10:23:58,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:58,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 10:23:58,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:58,014 INFO L225 Difference]: With dead ends: 1933 [2018-11-10 10:23:58,014 INFO L226 Difference]: Without dead ends: 1291 [2018-11-10 10:23:58,015 INFO L605 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-10 10:23:58,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-11-10 10:23:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2018-11-10 10:23:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-10 10:23:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2119 transitions. [2018-11-10 10:23:58,050 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2119 transitions. Word has length 28 [2018-11-10 10:23:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:58,051 INFO L481 AbstractCegarLoop]: Abstraction has 1289 states and 2119 transitions. [2018-11-10 10:23:58,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2119 transitions. [2018-11-10 10:23:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:23:58,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:58,053 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-10 10:23:58,053 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:58,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1848649485, now seen corresponding path program 1 times [2018-11-10 10:23:58,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:58,073 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-10 10:23:58,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:58,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:58,074 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:58,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:58,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:58,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:58,074 INFO L87 Difference]: Start difference. First operand 1289 states and 2119 transitions. Second operand 3 states. [2018-11-10 10:23:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:58,102 INFO L93 Difference]: Finished difference Result 1597 states and 2681 transitions. [2018-11-10 10:23:58,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:58,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 10:23:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:58,107 INFO L225 Difference]: With dead ends: 1597 [2018-11-10 10:23:58,107 INFO L226 Difference]: Without dead ends: 1595 [2018-11-10 10:23:58,108 INFO L605 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-10 10:23:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-10 10:23:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1289. [2018-11-10 10:23:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-10 10:23:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2103 transitions. [2018-11-10 10:23:58,144 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2103 transitions. Word has length 28 [2018-11-10 10:23:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:58,144 INFO L481 AbstractCegarLoop]: Abstraction has 1289 states and 2103 transitions. [2018-11-10 10:23:58,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2103 transitions. [2018-11-10 10:23:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:23:58,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:58,147 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-10 10:23:58,147 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:58,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:58,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1233273980, now seen corresponding path program 1 times [2018-11-10 10:23:58,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:58,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:58,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,148 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:58,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-10 10:23:58,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:58,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:58,166 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:58,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:58,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:58,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:58,167 INFO L87 Difference]: Start difference. First operand 1289 states and 2103 transitions. Second operand 3 states. [2018-11-10 10:23:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:58,205 INFO L93 Difference]: Finished difference Result 2365 states and 3929 transitions. [2018-11-10 10:23:58,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:58,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 10:23:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:58,212 INFO L225 Difference]: With dead ends: 2365 [2018-11-10 10:23:58,212 INFO L226 Difference]: Without dead ends: 2363 [2018-11-10 10:23:58,213 INFO L605 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-10 10:23:58,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2018-11-10 10:23:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1817. [2018-11-10 10:23:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2018-11-10 10:23:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2903 transitions. [2018-11-10 10:23:58,264 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2903 transitions. Word has length 29 [2018-11-10 10:23:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:58,265 INFO L481 AbstractCegarLoop]: Abstraction has 1817 states and 2903 transitions. [2018-11-10 10:23:58,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2903 transitions. [2018-11-10 10:23:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:23:58,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:58,283 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-10 10:23:58,283 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:58,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:58,284 INFO L82 PathProgramCache]: Analyzing trace with hash 212205626, now seen corresponding path program 1 times [2018-11-10 10:23:58,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:58,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:58,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,284 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:58,312 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-10 10:23:58,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:58,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:58,313 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:58,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:58,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:58,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:58,313 INFO L87 Difference]: Start difference. First operand 1817 states and 2903 transitions. Second operand 3 states. [2018-11-10 10:23:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:58,365 INFO L93 Difference]: Finished difference Result 4317 states and 6937 transitions. [2018-11-10 10:23:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:58,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 10:23:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:58,372 INFO L225 Difference]: With dead ends: 4317 [2018-11-10 10:23:58,373 INFO L226 Difference]: Without dead ends: 2523 [2018-11-10 10:23:58,375 INFO L605 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-10 10:23:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-11-10 10:23:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2521. [2018-11-10 10:23:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2018-11-10 10:23:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4007 transitions. [2018-11-10 10:23:58,433 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4007 transitions. Word has length 29 [2018-11-10 10:23:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:58,433 INFO L481 AbstractCegarLoop]: Abstraction has 2521 states and 4007 transitions. [2018-11-10 10:23:58,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4007 transitions. [2018-11-10 10:23:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 10:23:58,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:58,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, 1, 1, 1, 1] [2018-11-10 10:23:58,436 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:58,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash -422998170, now seen corresponding path program 1 times [2018-11-10 10:23:58,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:58,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:58,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:58,469 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-10 10:23:58,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:58,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:58,469 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:58,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:58,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:58,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:58,470 INFO L87 Difference]: Start difference. First operand 2521 states and 4007 transitions. Second operand 3 states. [2018-11-10 10:23:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:58,523 INFO L93 Difference]: Finished difference Result 3805 states and 6041 transitions. [2018-11-10 10:23:58,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:58,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 10:23:58,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:58,530 INFO L225 Difference]: With dead ends: 3805 [2018-11-10 10:23:58,531 INFO L226 Difference]: Without dead ends: 2571 [2018-11-10 10:23:58,533 INFO L605 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-10 10:23:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2018-11-10 10:23:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2569. [2018-11-10 10:23:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2018-11-10 10:23:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4039 transitions. [2018-11-10 10:23:58,594 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4039 transitions. Word has length 30 [2018-11-10 10:23:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:58,594 INFO L481 AbstractCegarLoop]: Abstraction has 2569 states and 4039 transitions. [2018-11-10 10:23:58,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4039 transitions. [2018-11-10 10:23:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 10:23:58,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:58,597 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-10 10:23:58,597 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:58,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2011346072, now seen corresponding path program 1 times [2018-11-10 10:23:58,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:58,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:58,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,598 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:58,612 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-10 10:23:58,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:58,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:58,613 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:58,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:58,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:58,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:58,613 INFO L87 Difference]: Start difference. First operand 2569 states and 4039 transitions. Second operand 3 states. [2018-11-10 10:23:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:58,675 INFO L93 Difference]: Finished difference Result 4621 states and 7401 transitions. [2018-11-10 10:23:58,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:58,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 10:23:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:58,687 INFO L225 Difference]: With dead ends: 4621 [2018-11-10 10:23:58,687 INFO L226 Difference]: Without dead ends: 4619 [2018-11-10 10:23:58,689 INFO L605 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-10 10:23:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-10 10:23:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 3657. [2018-11-10 10:23:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-11-10 10:23:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 5607 transitions. [2018-11-10 10:23:58,772 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 5607 transitions. Word has length 30 [2018-11-10 10:23:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:58,773 INFO L481 AbstractCegarLoop]: Abstraction has 3657 states and 5607 transitions. [2018-11-10 10:23:58,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 5607 transitions. [2018-11-10 10:23:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 10:23:58,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:58,777 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-10 10:23:58,777 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:58,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:58,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1262552870, now seen corresponding path program 1 times [2018-11-10 10:23:58,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:58,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:58,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:58,778 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:58,802 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-10 10:23:58,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:58,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:58,803 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:58,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:58,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:58,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:58,804 INFO L87 Difference]: Start difference. First operand 3657 states and 5607 transitions. Second operand 3 states. [2018-11-10 10:23:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:58,885 INFO L93 Difference]: Finished difference Result 8589 states and 13225 transitions. [2018-11-10 10:23:58,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:58,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 10:23:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:58,900 INFO L225 Difference]: With dead ends: 8589 [2018-11-10 10:23:58,900 INFO L226 Difference]: Without dead ends: 5003 [2018-11-10 10:23:58,905 INFO L605 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-10 10:23:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-11-10 10:23:59,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 5001. [2018-11-10 10:23:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5001 states. [2018-11-10 10:23:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 7623 transitions. [2018-11-10 10:23:59,022 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 7623 transitions. Word has length 30 [2018-11-10 10:23:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:59,023 INFO L481 AbstractCegarLoop]: Abstraction has 5001 states and 7623 transitions. [2018-11-10 10:23:59,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 7623 transitions. [2018-11-10 10:23:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 10:23:59,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:59,027 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-10 10:23:59,027 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:59,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:59,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2072995663, now seen corresponding path program 1 times [2018-11-10 10:23:59,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:59,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:59,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:59,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:59,028 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:59,042 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-10 10:23:59,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:59,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:59,042 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:59,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:59,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:59,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:59,043 INFO L87 Difference]: Start difference. First operand 5001 states and 7623 transitions. Second operand 3 states. [2018-11-10 10:23:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:59,136 INFO L93 Difference]: Finished difference Result 7501 states and 11401 transitions. [2018-11-10 10:23:59,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:59,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 10:23:59,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:59,159 INFO L225 Difference]: With dead ends: 7501 [2018-11-10 10:23:59,159 INFO L226 Difference]: Without dead ends: 5067 [2018-11-10 10:23:59,161 INFO L605 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-10 10:23:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-11-10 10:23:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5065. [2018-11-10 10:23:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5065 states. [2018-11-10 10:23:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 7623 transitions. [2018-11-10 10:23:59,226 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 7623 transitions. Word has length 31 [2018-11-10 10:23:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:59,226 INFO L481 AbstractCegarLoop]: Abstraction has 5065 states and 7623 transitions. [2018-11-10 10:23:59,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 7623 transitions. [2018-11-10 10:23:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 10:23:59,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:59,229 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-10 10:23:59,229 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:59,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 484647761, now seen corresponding path program 1 times [2018-11-10 10:23:59,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:59,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:59,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:59,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:59,231 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:59,244 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-10 10:23:59,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:59,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:59,244 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:59,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:59,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:59,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:59,245 INFO L87 Difference]: Start difference. First operand 5065 states and 7623 transitions. Second operand 3 states. [2018-11-10 10:23:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:59,306 INFO L93 Difference]: Finished difference Result 8973 states and 13769 transitions. [2018-11-10 10:23:59,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:59,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 10:23:59,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:59,315 INFO L225 Difference]: With dead ends: 8973 [2018-11-10 10:23:59,315 INFO L226 Difference]: Without dead ends: 8971 [2018-11-10 10:23:59,317 INFO L605 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-10 10:23:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2018-11-10 10:23:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 7305. [2018-11-10 10:23:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7305 states. [2018-11-10 10:23:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 10695 transitions. [2018-11-10 10:23:59,404 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 10695 transitions. Word has length 31 [2018-11-10 10:23:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:59,404 INFO L481 AbstractCegarLoop]: Abstraction has 7305 states and 10695 transitions. [2018-11-10 10:23:59,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 10695 transitions. [2018-11-10 10:23:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 10:23:59,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:59,409 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-10 10:23:59,409 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:59,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:59,409 INFO L82 PathProgramCache]: Analyzing trace with hash -536420593, now seen corresponding path program 1 times [2018-11-10 10:23:59,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:59,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:59,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:59,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:59,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:59,422 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-10 10:23:59,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:59,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:59,422 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:59,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:59,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:59,423 INFO L87 Difference]: Start difference. First operand 7305 states and 10695 transitions. Second operand 3 states. [2018-11-10 10:23:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:59,516 INFO L93 Difference]: Finished difference Result 17037 states and 25033 transitions. [2018-11-10 10:23:59,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:59,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 10:23:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:59,526 INFO L225 Difference]: With dead ends: 17037 [2018-11-10 10:23:59,526 INFO L226 Difference]: Without dead ends: 9867 [2018-11-10 10:23:59,532 INFO L605 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-10 10:23:59,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2018-11-10 10:23:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9865. [2018-11-10 10:23:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9865 states. [2018-11-10 10:23:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9865 states to 9865 states and 14343 transitions. [2018-11-10 10:23:59,705 INFO L78 Accepts]: Start accepts. Automaton has 9865 states and 14343 transitions. Word has length 31 [2018-11-10 10:23:59,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:59,705 INFO L481 AbstractCegarLoop]: Abstraction has 9865 states and 14343 transitions. [2018-11-10 10:23:59,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 9865 states and 14343 transitions. [2018-11-10 10:23:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 10:23:59,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:59,710 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-10 10:23:59,711 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:59,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2139393499, now seen corresponding path program 1 times [2018-11-10 10:23:59,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:59,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:59,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:59,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:59,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:59,724 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-10 10:23:59,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:59,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:59,724 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:59,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:59,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:59,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:59,725 INFO L87 Difference]: Start difference. First operand 9865 states and 14343 transitions. Second operand 3 states. [2018-11-10 10:23:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:23:59,806 INFO L93 Difference]: Finished difference Result 14797 states and 21449 transitions. [2018-11-10 10:23:59,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:23:59,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 10:23:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:23:59,816 INFO L225 Difference]: With dead ends: 14797 [2018-11-10 10:23:59,816 INFO L226 Difference]: Without dead ends: 9995 [2018-11-10 10:23:59,821 INFO L605 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-10 10:23:59,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9995 states. [2018-11-10 10:23:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9995 to 9993. [2018-11-10 10:23:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9993 states. [2018-11-10 10:23:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9993 states to 9993 states and 14343 transitions. [2018-11-10 10:23:59,939 INFO L78 Accepts]: Start accepts. Automaton has 9993 states and 14343 transitions. Word has length 32 [2018-11-10 10:23:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:23:59,939 INFO L481 AbstractCegarLoop]: Abstraction has 9993 states and 14343 transitions. [2018-11-10 10:23:59,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:23:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 9993 states and 14343 transitions. [2018-11-10 10:23:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 10:23:59,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:23:59,944 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-10 10:23:59,944 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:23:59,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:23:59,945 INFO L82 PathProgramCache]: Analyzing trace with hash 551045597, now seen corresponding path program 1 times [2018-11-10 10:23:59,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:23:59,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:59,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:23:59,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:23:59,946 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:23:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:23:59,964 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-10 10:23:59,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:23:59,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:23:59,964 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:23:59,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:23:59,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:23:59,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:23:59,965 INFO L87 Difference]: Start difference. First operand 9993 states and 14343 transitions. Second operand 3 states. [2018-11-10 10:24:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:00,083 INFO L93 Difference]: Finished difference Result 17421 states and 25481 transitions. [2018-11-10 10:24:00,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:00,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 10:24:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:00,103 INFO L225 Difference]: With dead ends: 17421 [2018-11-10 10:24:00,103 INFO L226 Difference]: Without dead ends: 17419 [2018-11-10 10:24:00,107 INFO L605 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-10 10:24:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2018-11-10 10:24:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 14601. [2018-11-10 10:24:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14601 states. [2018-11-10 10:24:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 20359 transitions. [2018-11-10 10:24:00,299 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 20359 transitions. Word has length 32 [2018-11-10 10:24:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:00,299 INFO L481 AbstractCegarLoop]: Abstraction has 14601 states and 20359 transitions. [2018-11-10 10:24:00,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 20359 transitions. [2018-11-10 10:24:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 10:24:00,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:00,308 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-10 10:24:00,308 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:00,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:00,308 INFO L82 PathProgramCache]: Analyzing trace with hash -470022757, now seen corresponding path program 1 times [2018-11-10 10:24:00,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:00,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:00,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:00,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:00,309 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:00,328 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-10 10:24:00,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:00,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:00,328 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:00,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:00,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:00,329 INFO L87 Difference]: Start difference. First operand 14601 states and 20359 transitions. Second operand 3 states. [2018-11-10 10:24:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:00,471 INFO L93 Difference]: Finished difference Result 33805 states and 47241 transitions. [2018-11-10 10:24:00,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:00,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 10:24:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:00,497 INFO L225 Difference]: With dead ends: 33805 [2018-11-10 10:24:00,497 INFO L226 Difference]: Without dead ends: 19467 [2018-11-10 10:24:00,514 INFO L605 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-10 10:24:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19467 states. [2018-11-10 10:24:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19467 to 19465. [2018-11-10 10:24:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19465 states. [2018-11-10 10:24:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19465 states to 19465 states and 26887 transitions. [2018-11-10 10:24:00,832 INFO L78 Accepts]: Start accepts. Automaton has 19465 states and 26887 transitions. Word has length 32 [2018-11-10 10:24:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:00,833 INFO L481 AbstractCegarLoop]: Abstraction has 19465 states and 26887 transitions. [2018-11-10 10:24:00,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 19465 states and 26887 transitions. [2018-11-10 10:24:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 10:24:00,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:00,849 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-10 10:24:00,849 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:00,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:00,849 INFO L82 PathProgramCache]: Analyzing trace with hash -97240540, now seen corresponding path program 1 times [2018-11-10 10:24:00,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:00,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:00,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:00,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:00,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:00,877 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-10 10:24:00,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:00,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:00,878 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:00,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:00,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:00,878 INFO L87 Difference]: Start difference. First operand 19465 states and 26887 transitions. Second operand 3 states. [2018-11-10 10:24:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:01,098 INFO L93 Difference]: Finished difference Result 29197 states and 40201 transitions. [2018-11-10 10:24:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:01,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 10:24:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:01,111 INFO L225 Difference]: With dead ends: 29197 [2018-11-10 10:24:01,111 INFO L226 Difference]: Without dead ends: 19723 [2018-11-10 10:24:01,117 INFO L605 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-10 10:24:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19723 states. [2018-11-10 10:24:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19723 to 19721. [2018-11-10 10:24:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19721 states. [2018-11-10 10:24:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19721 states to 19721 states and 26887 transitions. [2018-11-10 10:24:01,357 INFO L78 Accepts]: Start accepts. Automaton has 19721 states and 26887 transitions. Word has length 33 [2018-11-10 10:24:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:01,357 INFO L481 AbstractCegarLoop]: Abstraction has 19721 states and 26887 transitions. [2018-11-10 10:24:01,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19721 states and 26887 transitions. [2018-11-10 10:24:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 10:24:01,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:01,364 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-10 10:24:01,364 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:01,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1685588442, now seen corresponding path program 1 times [2018-11-10 10:24:01,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:01,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:01,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:01,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:01,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:01,384 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-10 10:24:01,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:01,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:01,384 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:01,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:01,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:01,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:01,385 INFO L87 Difference]: Start difference. First operand 19721 states and 26887 transitions. Second operand 3 states. [2018-11-10 10:24:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:01,601 INFO L93 Difference]: Finished difference Result 33805 states and 46857 transitions. [2018-11-10 10:24:01,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:01,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 10:24:01,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:01,633 INFO L225 Difference]: With dead ends: 33805 [2018-11-10 10:24:01,633 INFO L226 Difference]: Without dead ends: 33803 [2018-11-10 10:24:01,642 INFO L605 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-10 10:24:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33803 states. [2018-11-10 10:24:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33803 to 29193. [2018-11-10 10:24:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29193 states. [2018-11-10 10:24:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29193 states to 29193 states and 38663 transitions. [2018-11-10 10:24:02,088 INFO L78 Accepts]: Start accepts. Automaton has 29193 states and 38663 transitions. Word has length 33 [2018-11-10 10:24:02,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:02,088 INFO L481 AbstractCegarLoop]: Abstraction has 29193 states and 38663 transitions. [2018-11-10 10:24:02,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 29193 states and 38663 transitions. [2018-11-10 10:24:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 10:24:02,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:02,099 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-10 10:24:02,099 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:02,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:02,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1588310500, now seen corresponding path program 1 times [2018-11-10 10:24:02,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:02,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:02,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:02,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:02,100 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:02,124 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-10 10:24:02,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:02,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:02,124 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:02,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:02,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:02,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:02,125 INFO L87 Difference]: Start difference. First operand 29193 states and 38663 transitions. Second operand 3 states. [2018-11-10 10:24:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:02,411 INFO L93 Difference]: Finished difference Result 67085 states and 88841 transitions. [2018-11-10 10:24:02,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:02,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 10:24:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:02,435 INFO L225 Difference]: With dead ends: 67085 [2018-11-10 10:24:02,435 INFO L226 Difference]: Without dead ends: 38411 [2018-11-10 10:24:02,454 INFO L605 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-10 10:24:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38411 states. [2018-11-10 10:24:03,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38411 to 38409. [2018-11-10 10:24:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38409 states. [2018-11-10 10:24:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38409 states to 38409 states and 50183 transitions. [2018-11-10 10:24:03,030 INFO L78 Accepts]: Start accepts. Automaton has 38409 states and 50183 transitions. Word has length 33 [2018-11-10 10:24:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:03,030 INFO L481 AbstractCegarLoop]: Abstraction has 38409 states and 50183 transitions. [2018-11-10 10:24:03,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 38409 states and 50183 transitions. [2018-11-10 10:24:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 10:24:03,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:03,042 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-10 10:24:03,042 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:03,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash -713418672, now seen corresponding path program 1 times [2018-11-10 10:24:03,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:03,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:03,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:03,069 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-10 10:24:03,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:03,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:03,070 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:03,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:03,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:03,071 INFO L87 Difference]: Start difference. First operand 38409 states and 50183 transitions. Second operand 3 states. [2018-11-10 10:24:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:03,355 INFO L93 Difference]: Finished difference Result 57613 states and 75017 transitions. [2018-11-10 10:24:03,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:03,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 10:24:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:03,380 INFO L225 Difference]: With dead ends: 57613 [2018-11-10 10:24:03,380 INFO L226 Difference]: Without dead ends: 38923 [2018-11-10 10:24:03,393 INFO L605 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-10 10:24:03,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38923 states. [2018-11-10 10:24:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38923 to 38921. [2018-11-10 10:24:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38921 states. [2018-11-10 10:24:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38921 states to 38921 states and 50183 transitions. [2018-11-10 10:24:03,948 INFO L78 Accepts]: Start accepts. Automaton has 38921 states and 50183 transitions. Word has length 34 [2018-11-10 10:24:03,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:03,948 INFO L481 AbstractCegarLoop]: Abstraction has 38921 states and 50183 transitions. [2018-11-10 10:24:03,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand 38921 states and 50183 transitions. [2018-11-10 10:24:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 10:24:03,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:03,960 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-10 10:24:03,961 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:03,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:03,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1993200722, now seen corresponding path program 1 times [2018-11-10 10:24:03,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:03,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:03,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:03,984 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-10 10:24:03,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:03,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:03,985 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:03,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:03,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:03,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:03,985 INFO L87 Difference]: Start difference. First operand 38921 states and 50183 transitions. Second operand 3 states. [2018-11-10 10:24:04,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:04,499 INFO L93 Difference]: Finished difference Result 65549 states and 85513 transitions. [2018-11-10 10:24:04,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:04,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 10:24:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:04,540 INFO L225 Difference]: With dead ends: 65549 [2018-11-10 10:24:04,540 INFO L226 Difference]: Without dead ends: 65547 [2018-11-10 10:24:04,551 INFO L605 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-10 10:24:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65547 states. [2018-11-10 10:24:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65547 to 58377. [2018-11-10 10:24:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58377 states. [2018-11-10 10:24:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58377 states to 58377 states and 73223 transitions. [2018-11-10 10:24:05,346 INFO L78 Accepts]: Start accepts. Automaton has 58377 states and 73223 transitions. Word has length 34 [2018-11-10 10:24:05,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:05,346 INFO L481 AbstractCegarLoop]: Abstraction has 58377 states and 73223 transitions. [2018-11-10 10:24:05,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 58377 states and 73223 transitions. [2018-11-10 10:24:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 10:24:05,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:05,372 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-10 10:24:05,372 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:05,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:05,372 INFO L82 PathProgramCache]: Analyzing trace with hash 972132368, now seen corresponding path program 1 times [2018-11-10 10:24:05,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:05,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:05,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:05,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:05,373 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:05,397 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-10 10:24:05,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:05,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:05,397 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:05,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:05,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:05,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:05,398 INFO L87 Difference]: Start difference. First operand 58377 states and 73223 transitions. Second operand 3 states. [2018-11-10 10:24:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:06,041 INFO L93 Difference]: Finished difference Result 133133 states and 166409 transitions. [2018-11-10 10:24:06,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:06,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 10:24:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:06,096 INFO L225 Difference]: With dead ends: 133133 [2018-11-10 10:24:06,097 INFO L226 Difference]: Without dead ends: 75787 [2018-11-10 10:24:06,131 INFO L605 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-10 10:24:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75787 states. [2018-11-10 10:24:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75787 to 75785. [2018-11-10 10:24:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75785 states. [2018-11-10 10:24:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75785 states to 75785 states and 93191 transitions. [2018-11-10 10:24:07,236 INFO L78 Accepts]: Start accepts. Automaton has 75785 states and 93191 transitions. Word has length 34 [2018-11-10 10:24:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:07,237 INFO L481 AbstractCegarLoop]: Abstraction has 75785 states and 93191 transitions. [2018-11-10 10:24:07,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 75785 states and 93191 transitions. [2018-11-10 10:24:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 10:24:07,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:07,259 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-10 10:24:07,259 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:07,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1659896057, now seen corresponding path program 1 times [2018-11-10 10:24:07,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:07,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:07,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:07,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:07,260 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:07,284 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-10 10:24:07,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:07,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:07,285 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:07,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:07,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:07,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:07,285 INFO L87 Difference]: Start difference. First operand 75785 states and 93191 transitions. Second operand 3 states. [2018-11-10 10:24:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:07,888 INFO L93 Difference]: Finished difference Result 113677 states and 139273 transitions. [2018-11-10 10:24:07,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:07,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 10:24:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:07,941 INFO L225 Difference]: With dead ends: 113677 [2018-11-10 10:24:07,941 INFO L226 Difference]: Without dead ends: 76811 [2018-11-10 10:24:07,966 INFO L605 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-10 10:24:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76811 states. [2018-11-10 10:24:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76811 to 76809. [2018-11-10 10:24:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76809 states. [2018-11-10 10:24:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76809 states to 76809 states and 93191 transitions. [2018-11-10 10:24:09,100 INFO L78 Accepts]: Start accepts. Automaton has 76809 states and 93191 transitions. Word has length 35 [2018-11-10 10:24:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:09,100 INFO L481 AbstractCegarLoop]: Abstraction has 76809 states and 93191 transitions. [2018-11-10 10:24:09,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 76809 states and 93191 transitions. [2018-11-10 10:24:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 10:24:09,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:09,123 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-10 10:24:09,123 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:09,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:09,123 INFO L82 PathProgramCache]: Analyzing trace with hash 71548155, now seen corresponding path program 1 times [2018-11-10 10:24:09,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:09,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:09,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:09,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:09,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:09,140 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-10 10:24:09,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:09,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:09,140 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:09,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:09,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:09,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:09,141 INFO L87 Difference]: Start difference. First operand 76809 states and 93191 transitions. Second operand 3 states. [2018-11-10 10:24:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:10,245 INFO L93 Difference]: Finished difference Result 126989 states and 154633 transitions. [2018-11-10 10:24:10,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:10,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 10:24:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:10,324 INFO L225 Difference]: With dead ends: 126989 [2018-11-10 10:24:10,324 INFO L226 Difference]: Without dead ends: 126987 [2018-11-10 10:24:10,335 INFO L605 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-10 10:24:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126987 states. [2018-11-10 10:24:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126987 to 116745. [2018-11-10 10:24:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116745 states. [2018-11-10 10:24:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116745 states to 116745 states and 138247 transitions. [2018-11-10 10:24:11,541 INFO L78 Accepts]: Start accepts. Automaton has 116745 states and 138247 transitions. Word has length 35 [2018-11-10 10:24:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:11,541 INFO L481 AbstractCegarLoop]: Abstraction has 116745 states and 138247 transitions. [2018-11-10 10:24:11,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 116745 states and 138247 transitions. [2018-11-10 10:24:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 10:24:11,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:11,587 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-10 10:24:11,587 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:11,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:11,587 INFO L82 PathProgramCache]: Analyzing trace with hash -949520199, now seen corresponding path program 1 times [2018-11-10 10:24:11,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:11,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:11,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:11,612 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-10 10:24:11,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:11,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:11,613 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:11,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:11,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:11,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:11,613 INFO L87 Difference]: Start difference. First operand 116745 states and 138247 transitions. Second operand 3 states. [2018-11-10 10:24:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:13,124 INFO L93 Difference]: Finished difference Result 264205 states and 310281 transitions. [2018-11-10 10:24:13,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:13,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 10:24:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:13,225 INFO L225 Difference]: With dead ends: 264205 [2018-11-10 10:24:13,225 INFO L226 Difference]: Without dead ends: 149515 [2018-11-10 10:24:13,282 INFO L605 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-10 10:24:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149515 states. [2018-11-10 10:24:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149515 to 149513. [2018-11-10 10:24:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149513 states. [2018-11-10 10:24:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149513 states to 149513 states and 172039 transitions. [2018-11-10 10:24:15,452 INFO L78 Accepts]: Start accepts. Automaton has 149513 states and 172039 transitions. Word has length 35 [2018-11-10 10:24:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:15,452 INFO L481 AbstractCegarLoop]: Abstraction has 149513 states and 172039 transitions. [2018-11-10 10:24:15,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 149513 states and 172039 transitions. [2018-11-10 10:24:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 10:24:15,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:15,502 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-10 10:24:15,502 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:15,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:15,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2076758331, now seen corresponding path program 1 times [2018-11-10 10:24:15,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:15,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:15,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:15,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:15,503 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:15,528 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-10 10:24:15,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:15,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:15,529 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:15,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:15,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:15,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:15,529 INFO L87 Difference]: Start difference. First operand 149513 states and 172039 transitions. Second operand 3 states. [2018-11-10 10:24:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:16,806 INFO L93 Difference]: Finished difference Result 224269 states and 257033 transitions. [2018-11-10 10:24:16,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:16,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 10:24:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:16,925 INFO L225 Difference]: With dead ends: 224269 [2018-11-10 10:24:16,925 INFO L226 Difference]: Without dead ends: 151563 [2018-11-10 10:24:16,976 INFO L605 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-10 10:24:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151563 states. [2018-11-10 10:24:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151563 to 151561. [2018-11-10 10:24:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151561 states. [2018-11-10 10:24:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151561 states to 151561 states and 172039 transitions. [2018-11-10 10:24:21,181 INFO L78 Accepts]: Start accepts. Automaton has 151561 states and 172039 transitions. Word has length 36 [2018-11-10 10:24:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:21,181 INFO L481 AbstractCegarLoop]: Abstraction has 151561 states and 172039 transitions. [2018-11-10 10:24:21,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 151561 states and 172039 transitions. [2018-11-10 10:24:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 10:24:21,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:21,231 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-10 10:24:21,231 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:21,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:21,231 INFO L82 PathProgramCache]: Analyzing trace with hash 629861063, now seen corresponding path program 1 times [2018-11-10 10:24:21,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:21,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:21,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:21,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:21,232 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:21,265 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-10 10:24:21,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:21,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:21,265 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:21,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:21,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:21,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:21,266 INFO L87 Difference]: Start difference. First operand 151561 states and 172039 transitions. Second operand 3 states. [2018-11-10 10:24:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:23,755 INFO L93 Difference]: Finished difference Result 442379 states and 491528 transitions. [2018-11-10 10:24:23,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:23,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 10:24:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:23,888 INFO L225 Difference]: With dead ends: 442379 [2018-11-10 10:24:23,889 INFO L226 Difference]: Without dead ends: 151561 [2018-11-10 10:24:24,025 INFO L605 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-10 10:24:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151561 states. [2018-11-10 10:24:26,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151561 to 151561. [2018-11-10 10:24:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151561 states. [2018-11-10 10:24:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151561 states to 151561 states and 163847 transitions. [2018-11-10 10:24:26,256 INFO L78 Accepts]: Start accepts. Automaton has 151561 states and 163847 transitions. Word has length 36 [2018-11-10 10:24:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:26,256 INFO L481 AbstractCegarLoop]: Abstraction has 151561 states and 163847 transitions. [2018-11-10 10:24:26,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 151561 states and 163847 transitions. [2018-11-10 10:24:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 10:24:26,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:24:26,305 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-10 10:24:26,306 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:24:26,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:24:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1650929417, now seen corresponding path program 1 times [2018-11-10 10:24:26,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:24:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:24:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:24:26,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:24:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:24:26,322 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-10 10:24:26,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:24:26,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:24:26,322 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:24:26,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:24:26,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:24:26,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:24:26,323 INFO L87 Difference]: Start difference. First operand 151561 states and 163847 transitions. Second operand 3 states. [2018-11-10 10:24:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:24:27,452 INFO L93 Difference]: Finished difference Result 151561 states and 163847 transitions. [2018-11-10 10:24:27,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:24:27,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 10:24:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:24:27,453 INFO L225 Difference]: With dead ends: 151561 [2018-11-10 10:24:27,453 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 10:24:27,525 INFO L605 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-10 10:24:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 10:24:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 10:24:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 10:24:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:24:27,526 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-10 10:24:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:24:27,526 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:24:27,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:24:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:24:27,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 10:24:27,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 10:24:27,574 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 10:24:27,574 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L428 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,574 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L425 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,575 INFO L428 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-11-10 10:24:27,576 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,576 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-11-10 10:24:27,576 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-11-10 10:24:27,576 INFO L425 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-11-10 10:24:27,576 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,576 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-10 10:24:27,576 INFO L421 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-11-10 10:24:27,576 INFO L425 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,576 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,576 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-11-10 10:24:27,576 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,576 INFO L425 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,577 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-10 10:24:27,577 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,577 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-11-10 10:24:27,577 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-10 10:24:27,577 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,577 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,577 INFO L425 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 10:24:27,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:24:27 BoogieIcfgContainer [2018-11-10 10:24:27,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:24:27,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:24:27,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:24:27,587 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:24:27,587 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:23:56" (3/4) ... [2018-11-10 10:24:27,590 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 10:24:27,596 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 10:24:27,597 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 10:24:27,601 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 10:24:27,602 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 10:24:27,602 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 10:24:27,652 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0b78b234-d24f-48e1-89dd-30b33bd5c896/bin-2019/utaipan/witness.graphml [2018-11-10 10:24:27,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:24:27,653 INFO L168 Benchmark]: Toolchain (without parser) took 31239.89 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.5 GB). Free memory was 961.9 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-11-10 10:24:27,654 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:24:27,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.84 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:24:27,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.81 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:24:27,655 INFO L168 Benchmark]: Boogie Preprocessor took 19.45 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:24:27,655 INFO L168 Benchmark]: RCFGBuilder took 251.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:24:27,655 INFO L168 Benchmark]: TraceAbstraction took 30708.87 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-11-10 10:24:27,655 INFO L168 Benchmark]: Witness Printer took 65.96 ms. Allocated memory is still 5.5 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:24:27,657 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.84 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.81 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.45 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 251.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30708.87 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 65.96 ms. Allocated memory is still 5.5 GB. Free memory is still 2.2 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.6s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 12.8s 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.4s 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: 16.1s 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...