./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/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 0f7b0b589689413087c164ce10eb80c902ee4046 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 22:18:49,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:18:49,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:18:49,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:18:49,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:18:49,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:18:49,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:18:49,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:18:49,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:18:49,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:18:49,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:18:49,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:18:49,035 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:18:49,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:18:49,036 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:18:49,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:18:49,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:18:49,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:18:49,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:18:49,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:18:49,040 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:18:49,041 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:18:49,042 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:18:49,042 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:18:49,042 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:18:49,043 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:18:49,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:18:49,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:18:49,044 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:18:49,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:18:49,045 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:18:49,045 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:18:49,045 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:18:49,045 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:18:49,046 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:18:49,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:18:49,046 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-01 22:18:49,053 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:18:49,053 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:18:49,054 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:18:49,054 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 22:18:49,054 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-01 22:18:49,054 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-01 22:18:49,054 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-01 22:18:49,054 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-01 22:18:49,054 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-01 22:18:49,054 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-01 22:18:49,055 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-01 22:18:49,055 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-01 22:18:49,055 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-01 22:18:49,055 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:18:49,055 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:18:49,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:18:49,056 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:18:49,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:18:49,056 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 22:18:49,056 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:18:49,056 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 22:18:49,056 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:18:49,056 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:18:49,056 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 22:18:49,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:18:49,057 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:18:49,057 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:18:49,057 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 22:18:49,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 22:18:49,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:18:49,057 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:18:49,057 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 22:18:49,057 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-01 22:18:49,057 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:18:49,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 22:18:49,058 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-01 22:18:49,058 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_066a9163-2e81-4bea-a5b0-1690bf8efffc/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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-12-01 22:18:49,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:18:49,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:18:49,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:18:49,084 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:18:49,085 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:18:49,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 22:18:49,118 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/data/a0749586d/614f0229abe44c2ab0d6548aab5262cd/FLAGeca33ebc0 [2018-12-01 22:18:49,488 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:18:49,489 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 22:18:49,493 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/data/a0749586d/614f0229abe44c2ab0d6548aab5262cd/FLAGeca33ebc0 [2018-12-01 22:18:49,501 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/data/a0749586d/614f0229abe44c2ab0d6548aab5262cd [2018-12-01 22:18:49,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:18:49,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:18:49,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:18:49,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:18:49,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:18:49,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:18:49" (1/1) ... [2018-12-01 22:18:49,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49, skipping insertion in model container [2018-12-01 22:18:49,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:18:49" (1/1) ... [2018-12-01 22:18:49,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:18:49,528 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:18:49,643 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:18:49,645 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:18:49,661 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:18:49,670 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:18:49,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49 WrapperNode [2018-12-01 22:18:49,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:18:49,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:18:49,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:18:49,670 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:18:49,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49" (1/1) ... [2018-12-01 22:18:49,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49" (1/1) ... [2018-12-01 22:18:49,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:18:49,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:18:49,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:18:49,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:18:49,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49" (1/1) ... [2018-12-01 22:18:49,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49" (1/1) ... [2018-12-01 22:18:49,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49" (1/1) ... [2018-12-01 22:18:49,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49" (1/1) ... [2018-12-01 22:18:49,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49" (1/1) ... [2018-12-01 22:18:49,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49" (1/1) ... [2018-12-01 22:18:49,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49" (1/1) ... [2018-12-01 22:18:49,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:18:49,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:18:49,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:18:49,740 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:18:49,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 22:18:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 22:18:49,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 22:18:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:18:49,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:18:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 22:18:49,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 22:18:49,930 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:18:49,930 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 22:18:49,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:18:49 BoogieIcfgContainer [2018-12-01 22:18:49,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:18:49,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 22:18:49,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 22:18:49,933 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 22:18:49,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 10:18:49" (1/3) ... [2018-12-01 22:18:49,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d456c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:18:49, skipping insertion in model container [2018-12-01 22:18:49,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:49" (2/3) ... [2018-12-01 22:18:49,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d456c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:18:49, skipping insertion in model container [2018-12-01 22:18:49,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:18:49" (3/3) ... [2018-12-01 22:18:49,936 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 22:18:49,941 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 22:18:49,948 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 22:18:49,959 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 22:18:49,978 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 22:18:49,978 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 22:18:49,978 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 22:18:49,978 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:18:49,978 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:18:49,978 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 22:18:49,978 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:18:49,978 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 22:18:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-12-01 22:18:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 22:18:49,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:49,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:18:49,997 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,002 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2018-12-01 22:18:50,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,116 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2018-12-01 22:18:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,143 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2018-12-01 22:18:50,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-01 22:18:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,150 INFO L225 Difference]: With dead ends: 87 [2018-12-01 22:18:50,150 INFO L226 Difference]: Without dead ends: 72 [2018-12-01 22:18:50,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-01 22:18:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-12-01 22:18:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-01 22:18:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2018-12-01 22:18:50,175 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2018-12-01 22:18:50,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,176 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2018-12-01 22:18:50,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2018-12-01 22:18:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 22:18:50,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:18:50,177 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2018-12-01 22:18:50,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,212 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2018-12-01 22:18:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,234 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2018-12-01 22:18:50,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-01 22:18:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,235 INFO L225 Difference]: With dead ends: 117 [2018-12-01 22:18:50,235 INFO L226 Difference]: Without dead ends: 72 [2018-12-01 22:18:50,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-01 22:18:50,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-12-01 22:18:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-01 22:18:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2018-12-01 22:18:50,240 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2018-12-01 22:18:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,240 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2018-12-01 22:18:50,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2018-12-01 22:18:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 22:18:50,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:18:50,241 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2018-12-01 22:18:50,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,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-12-01 22:18:50,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,266 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2018-12-01 22:18:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,284 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2018-12-01 22:18:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-01 22:18:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,285 INFO L225 Difference]: With dead ends: 108 [2018-12-01 22:18:50,285 INFO L226 Difference]: Without dead ends: 75 [2018-12-01 22:18:50,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-01 22:18:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-01 22:18:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-01 22:18:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2018-12-01 22:18:50,290 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2018-12-01 22:18:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,290 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2018-12-01 22:18:50,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-12-01 22:18:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 22:18:50,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:18:50,291 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,291 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2018-12-01 22:18:50,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,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-12-01 22:18:50,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,312 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,313 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2018-12-01 22:18:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,323 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2018-12-01 22:18:50,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-01 22:18:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,325 INFO L225 Difference]: With dead ends: 136 [2018-12-01 22:18:50,325 INFO L226 Difference]: Without dead ends: 134 [2018-12-01 22:18:50,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-01 22:18:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-12-01 22:18:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-01 22:18:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2018-12-01 22:18:50,330 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2018-12-01 22:18:50,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,331 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2018-12-01 22:18:50,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2018-12-01 22:18:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 22:18:50,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:18:50,332 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2018-12-01 22:18:50,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,349 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2018-12-01 22:18:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,365 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2018-12-01 22:18:50,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-01 22:18:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,367 INFO L225 Difference]: With dead ends: 224 [2018-12-01 22:18:50,367 INFO L226 Difference]: Without dead ends: 136 [2018-12-01 22:18:50,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-01 22:18:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-12-01 22:18:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-01 22:18:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2018-12-01 22:18:50,376 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2018-12-01 22:18:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,377 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2018-12-01 22:18:50,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2018-12-01 22:18:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 22:18:50,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,378 INFO L402 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] [2018-12-01 22:18:50,378 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2018-12-01 22:18:50,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,402 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2018-12-01 22:18:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,416 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2018-12-01 22:18:50,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-01 22:18:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,417 INFO L225 Difference]: With dead ends: 201 [2018-12-01 22:18:50,417 INFO L226 Difference]: Without dead ends: 138 [2018-12-01 22:18:50,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-01 22:18:50,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-12-01 22:18:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-01 22:18:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2018-12-01 22:18:50,424 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2018-12-01 22:18:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,425 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2018-12-01 22:18:50,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2018-12-01 22:18:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 22:18:50,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,426 INFO L402 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] [2018-12-01 22:18:50,426 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,426 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2018-12-01 22:18:50,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,446 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2018-12-01 22:18:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,460 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2018-12-01 22:18:50,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-01 22:18:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,461 INFO L225 Difference]: With dead ends: 252 [2018-12-01 22:18:50,461 INFO L226 Difference]: Without dead ends: 250 [2018-12-01 22:18:50,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-01 22:18:50,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2018-12-01 22:18:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-01 22:18:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2018-12-01 22:18:50,470 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2018-12-01 22:18:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,471 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2018-12-01 22:18:50,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2018-12-01 22:18:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 22:18:50,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,472 INFO L402 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] [2018-12-01 22:18:50,472 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,472 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2018-12-01 22:18:50,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,493 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2018-12-01 22:18:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,507 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2018-12-01 22:18:50,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-01 22:18:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,508 INFO L225 Difference]: With dead ends: 432 [2018-12-01 22:18:50,508 INFO L226 Difference]: Without dead ends: 258 [2018-12-01 22:18:50,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-01 22:18:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-12-01 22:18:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:18:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2018-12-01 22:18:50,515 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2018-12-01 22:18:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,515 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2018-12-01 22:18:50,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2018-12-01 22:18:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 22:18:50,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,516 INFO L402 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] [2018-12-01 22:18:50,516 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2018-12-01 22:18:50,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,530 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2018-12-01 22:18:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,541 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2018-12-01 22:18:50,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-01 22:18:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,543 INFO L225 Difference]: With dead ends: 384 [2018-12-01 22:18:50,543 INFO L226 Difference]: Without dead ends: 262 [2018-12-01 22:18:50,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-01 22:18:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-12-01 22:18:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-01 22:18:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2018-12-01 22:18:50,552 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2018-12-01 22:18:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,552 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2018-12-01 22:18:50,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2018-12-01 22:18:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 22:18:50,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,553 INFO L402 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] [2018-12-01 22:18:50,554 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2018-12-01 22:18:50,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,570 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2018-12-01 22:18:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,585 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2018-12-01 22:18:50,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-01 22:18:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,587 INFO L225 Difference]: With dead ends: 476 [2018-12-01 22:18:50,587 INFO L226 Difference]: Without dead ends: 474 [2018-12-01 22:18:50,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-12-01 22:18:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2018-12-01 22:18:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-01 22:18:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2018-12-01 22:18:50,599 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2018-12-01 22:18:50,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,599 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2018-12-01 22:18:50,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2018-12-01 22:18:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 22:18:50,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,600 INFO L402 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] [2018-12-01 22:18:50,600 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2018-12-01 22:18:50,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,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-12-01 22:18:50,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,613 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2018-12-01 22:18:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,630 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2018-12-01 22:18:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-01 22:18:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,632 INFO L225 Difference]: With dead ends: 844 [2018-12-01 22:18:50,632 INFO L226 Difference]: Without dead ends: 498 [2018-12-01 22:18:50,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-12-01 22:18:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2018-12-01 22:18:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-12-01 22:18:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2018-12-01 22:18:50,649 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2018-12-01 22:18:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,649 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2018-12-01 22:18:50,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2018-12-01 22:18:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 22:18:50,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,650 INFO L402 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-12-01 22:18:50,650 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,651 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2018-12-01 22:18:50,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,669 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2018-12-01 22:18:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,688 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2018-12-01 22:18:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-01 22:18:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,690 INFO L225 Difference]: With dead ends: 744 [2018-12-01 22:18:50,690 INFO L226 Difference]: Without dead ends: 506 [2018-12-01 22:18:50,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-12-01 22:18:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2018-12-01 22:18:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-12-01 22:18:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2018-12-01 22:18:50,707 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2018-12-01 22:18:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,707 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2018-12-01 22:18:50,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2018-12-01 22:18:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 22:18:50,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,708 INFO L402 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-12-01 22:18:50,708 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2018-12-01 22:18:50,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,724 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2018-12-01 22:18:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,738 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2018-12-01 22:18:50,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-01 22:18:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,740 INFO L225 Difference]: With dead ends: 908 [2018-12-01 22:18:50,740 INFO L226 Difference]: Without dead ends: 906 [2018-12-01 22:18:50,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-12-01 22:18:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2018-12-01 22:18:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-12-01 22:18:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2018-12-01 22:18:50,754 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2018-12-01 22:18:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,754 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2018-12-01 22:18:50,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2018-12-01 22:18:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 22:18:50,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,755 INFO L402 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-12-01 22:18:50,755 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2018-12-01 22:18:50,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,766 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2018-12-01 22:18:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,784 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2018-12-01 22:18:50,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-01 22:18:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,786 INFO L225 Difference]: With dead ends: 1660 [2018-12-01 22:18:50,786 INFO L226 Difference]: Without dead ends: 970 [2018-12-01 22:18:50,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-12-01 22:18:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2018-12-01 22:18:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-12-01 22:18:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2018-12-01 22:18:50,806 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2018-12-01 22:18:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,806 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2018-12-01 22:18:50,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2018-12-01 22:18:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 22:18:50,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,807 INFO L402 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-12-01 22:18:50,807 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2018-12-01 22:18:50,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,822 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2018-12-01 22:18:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,849 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2018-12-01 22:18:50,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 22:18:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,852 INFO L225 Difference]: With dead ends: 1452 [2018-12-01 22:18:50,852 INFO L226 Difference]: Without dead ends: 986 [2018-12-01 22:18:50,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-12-01 22:18:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2018-12-01 22:18:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-12-01 22:18:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2018-12-01 22:18:50,876 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2018-12-01 22:18:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,876 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2018-12-01 22:18:50,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2018-12-01 22:18:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 22:18:50,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,878 INFO L402 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-12-01 22:18:50,878 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2018-12-01 22:18:50,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,890 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2018-12-01 22:18:50,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:50,927 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2018-12-01 22:18:50,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:50,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 22:18:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:50,932 INFO L225 Difference]: With dead ends: 1740 [2018-12-01 22:18:50,932 INFO L226 Difference]: Without dead ends: 1738 [2018-12-01 22:18:50,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-12-01 22:18:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2018-12-01 22:18:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2018-12-01 22:18:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2018-12-01 22:18:50,968 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2018-12-01 22:18:50,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:50,968 INFO L480 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2018-12-01 22:18:50,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:50,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2018-12-01 22:18:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 22:18:50,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:50,970 INFO L402 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-12-01 22:18:50,970 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:50,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:50,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2018-12-01 22:18:50,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:50,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:50,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:50,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:50,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:50,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:50,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:50,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:50,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:50,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:50,982 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2018-12-01 22:18:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:51,032 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2018-12-01 22:18:51,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:51,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 22:18:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:51,038 INFO L225 Difference]: With dead ends: 3276 [2018-12-01 22:18:51,038 INFO L226 Difference]: Without dead ends: 1898 [2018-12-01 22:18:51,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-12-01 22:18:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2018-12-01 22:18:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2018-12-01 22:18:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2018-12-01 22:18:51,071 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2018-12-01 22:18:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:51,072 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2018-12-01 22:18:51,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2018-12-01 22:18:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 22:18:51,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:51,073 INFO L402 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-12-01 22:18:51,073 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:51,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2018-12-01 22:18:51,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:51,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:51,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:51,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:51,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:51,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:51,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:51,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,085 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2018-12-01 22:18:51,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:51,117 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2018-12-01 22:18:51,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:51,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 22:18:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:51,120 INFO L225 Difference]: With dead ends: 2844 [2018-12-01 22:18:51,120 INFO L226 Difference]: Without dead ends: 1930 [2018-12-01 22:18:51,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-12-01 22:18:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2018-12-01 22:18:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-12-01 22:18:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2018-12-01 22:18:51,153 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2018-12-01 22:18:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:51,154 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2018-12-01 22:18:51,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2018-12-01 22:18:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 22:18:51,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:51,155 INFO L402 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-12-01 22:18:51,155 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:51,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:51,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2018-12-01 22:18:51,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:51,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:51,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:51,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:51,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:51,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:51,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:51,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:51,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,169 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2018-12-01 22:18:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:51,216 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2018-12-01 22:18:51,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:51,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 22:18:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:51,222 INFO L225 Difference]: With dead ends: 3340 [2018-12-01 22:18:51,222 INFO L226 Difference]: Without dead ends: 3338 [2018-12-01 22:18:51,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-12-01 22:18:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2018-12-01 22:18:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-12-01 22:18:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2018-12-01 22:18:51,268 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2018-12-01 22:18:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:51,268 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2018-12-01 22:18:51,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2018-12-01 22:18:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 22:18:51,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:51,270 INFO L402 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-12-01 22:18:51,271 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:51,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:51,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2018-12-01 22:18:51,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:51,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:51,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:51,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:51,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:51,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,285 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2018-12-01 22:18:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:51,346 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2018-12-01 22:18:51,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:51,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 22:18:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:51,352 INFO L225 Difference]: With dead ends: 6476 [2018-12-01 22:18:51,352 INFO L226 Difference]: Without dead ends: 3722 [2018-12-01 22:18:51,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-12-01 22:18:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2018-12-01 22:18:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2018-12-01 22:18:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2018-12-01 22:18:51,419 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2018-12-01 22:18:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:51,419 INFO L480 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2018-12-01 22:18:51,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2018-12-01 22:18:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 22:18:51,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:51,422 INFO L402 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-12-01 22:18:51,422 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:51,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2018-12-01 22:18:51,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:51,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:51,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:51,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:51,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:51,430 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:51,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:51,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:51,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,430 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2018-12-01 22:18:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:51,471 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2018-12-01 22:18:51,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:51,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 22:18:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:51,477 INFO L225 Difference]: With dead ends: 5580 [2018-12-01 22:18:51,477 INFO L226 Difference]: Without dead ends: 3786 [2018-12-01 22:18:51,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-12-01 22:18:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2018-12-01 22:18:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-12-01 22:18:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2018-12-01 22:18:51,540 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2018-12-01 22:18:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:51,540 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2018-12-01 22:18:51,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2018-12-01 22:18:51,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 22:18:51,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:51,551 INFO L402 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-12-01 22:18:51,552 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:51,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:51,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2018-12-01 22:18:51,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:51,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:51,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:51,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:51,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:51,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:51,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:51,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:51,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,565 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2018-12-01 22:18:51,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:51,656 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2018-12-01 22:18:51,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:51,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 22:18:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:51,674 INFO L225 Difference]: With dead ends: 10956 [2018-12-01 22:18:51,674 INFO L226 Difference]: Without dead ends: 7306 [2018-12-01 22:18:51,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2018-12-01 22:18:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2018-12-01 22:18:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-12-01 22:18:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2018-12-01 22:18:51,793 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2018-12-01 22:18:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:51,793 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2018-12-01 22:18:51,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2018-12-01 22:18:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 22:18:51,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:51,797 INFO L402 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-12-01 22:18:51,797 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:51,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:51,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2018-12-01 22:18:51,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:51,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:51,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:51,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-12-01 22:18:51,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:51,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:51,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:51,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:51,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:51,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,806 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2018-12-01 22:18:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:51,891 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2018-12-01 22:18:51,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:51,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 22:18:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:51,899 INFO L225 Difference]: With dead ends: 8076 [2018-12-01 22:18:51,899 INFO L226 Difference]: Without dead ends: 8074 [2018-12-01 22:18:51,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-12-01 22:18:51,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2018-12-01 22:18:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-12-01 22:18:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2018-12-01 22:18:52,001 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2018-12-01 22:18:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:52,001 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2018-12-01 22:18:52,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2018-12-01 22:18:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 22:18:52,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:52,006 INFO L402 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-12-01 22:18:52,006 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:52,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:52,006 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2018-12-01 22:18:52,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:52,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:52,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:52,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:52,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:52,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:52,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:52,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:52,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:52,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:52,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:52,016 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2018-12-01 22:18:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:52,133 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2018-12-01 22:18:52,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:52,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 22:18:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:52,144 INFO L225 Difference]: With dead ends: 12172 [2018-12-01 22:18:52,144 INFO L226 Difference]: Without dead ends: 12170 [2018-12-01 22:18:52,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-12-01 22:18:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2018-12-01 22:18:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-01 22:18:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2018-12-01 22:18:52,267 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2018-12-01 22:18:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:52,267 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2018-12-01 22:18:52,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2018-12-01 22:18:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 22:18:52,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:52,274 INFO L402 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-12-01 22:18:52,274 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:52,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:52,275 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2018-12-01 22:18:52,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:52,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:52,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:52,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:52,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:52,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:52,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:52,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:52,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:52,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:52,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:52,288 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2018-12-01 22:18:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:52,412 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2018-12-01 22:18:52,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:52,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 22:18:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:52,426 INFO L225 Difference]: With dead ends: 25228 [2018-12-01 22:18:52,426 INFO L226 Difference]: Without dead ends: 14218 [2018-12-01 22:18:52,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2018-12-01 22:18:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2018-12-01 22:18:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-12-01 22:18:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2018-12-01 22:18:52,635 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2018-12-01 22:18:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:52,635 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2018-12-01 22:18:52,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2018-12-01 22:18:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 22:18:52,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:52,641 INFO L402 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-12-01 22:18:52,641 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:52,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2018-12-01 22:18:52,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:52,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:52,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:52,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:52,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:52,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:52,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:52,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:52,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:52,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:52,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:52,653 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2018-12-01 22:18:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:52,769 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2018-12-01 22:18:52,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:52,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 22:18:52,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:52,781 INFO L225 Difference]: With dead ends: 21516 [2018-12-01 22:18:52,781 INFO L226 Difference]: Without dead ends: 14602 [2018-12-01 22:18:52,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2018-12-01 22:18:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2018-12-01 22:18:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2018-12-01 22:18:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2018-12-01 22:18:52,972 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2018-12-01 22:18:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:52,972 INFO L480 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2018-12-01 22:18:52,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2018-12-01 22:18:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 22:18:52,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:52,978 INFO L402 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-12-01 22:18:52,978 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:52,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:52,978 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2018-12-01 22:18:52,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:52,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:52,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:52,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:52,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:52,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:52,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:52,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:52,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:52,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:52,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:52,986 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2018-12-01 22:18:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:53,213 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2018-12-01 22:18:53,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:53,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 22:18:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:53,227 INFO L225 Difference]: With dead ends: 23562 [2018-12-01 22:18:53,228 INFO L226 Difference]: Without dead ends: 23560 [2018-12-01 22:18:53,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2018-12-01 22:18:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2018-12-01 22:18:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2018-12-01 22:18:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2018-12-01 22:18:53,463 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2018-12-01 22:18:53,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:53,463 INFO L480 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2018-12-01 22:18:53,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2018-12-01 22:18:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 22:18:53,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:53,471 INFO L402 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-12-01 22:18:53,472 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:53,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2018-12-01 22:18:53,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:53,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:53,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:53,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:53,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:18:53,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:53,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:53,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:53,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:53,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:53,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:53,492 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2018-12-01 22:18:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:53,764 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2018-12-01 22:18:53,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:53,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 22:18:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:53,765 INFO L225 Difference]: With dead ends: 50184 [2018-12-01 22:18:53,765 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 22:18:53,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 22:18:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 22:18:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 22:18:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 22:18:53,792 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-12-01 22:18:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:53,792 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 22:18:53,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 22:18:53,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 22:18:53,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 22:18:53,814 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-01 22:18:53,814 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L451 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,814 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L451 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L444 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-12-01 22:18:53,815 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,816 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-12-01 22:18:53,816 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-01 22:18:53,816 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-12-01 22:18:53,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 10:18:53 BoogieIcfgContainer [2018-12-01 22:18:53,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 22:18:53,820 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:18:53,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:18:53,820 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:18:53,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:18:49" (3/4) ... [2018-12-01 22:18:53,823 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 22:18:53,828 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 22:18:53,828 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 22:18:53,831 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-01 22:18:53,831 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-01 22:18:53,831 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 22:18:53,864 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_066a9163-2e81-4bea-a5b0-1690bf8efffc/bin-2019/utaipan/witness.graphml [2018-12-01 22:18:53,864 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:18:53,865 INFO L168 Benchmark]: Toolchain (without parser) took 4361.03 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 453.0 MB). Free memory was 954.4 MB in the beginning and 1.2 GB in the end (delta: -240.6 MB). Peak memory consumption was 212.4 MB. Max. memory is 11.5 GB. [2018-12-01 22:18:53,865 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:18:53,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.54 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-01 22:18:53,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.15 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:18:53,866 INFO L168 Benchmark]: Boogie Preprocessor took 51.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-01 22:18:53,866 INFO L168 Benchmark]: RCFGBuilder took 190.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-12-01 22:18:53,866 INFO L168 Benchmark]: TraceAbstraction took 3889.11 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 345.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -122.1 MB). Peak memory consumption was 223.4 MB. Max. memory is 11.5 GB. [2018-12-01 22:18:53,866 INFO L168 Benchmark]: Witness Printer took 43.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-01 22:18:53,868 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.54 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.15 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 190.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3889.11 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 345.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -122.1 MB). Peak memory consumption was 223.4 MB. Max. memory is 11.5 GB. * Witness Printer took 43.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 44 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, 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: 1.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 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.2s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...