./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8_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_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/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 f2cbbf56a13532141372a32a461d64a9d1351c0e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 22:36:07,456 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 22:36:07,457 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 22:36:07,463 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 22:36:07,463 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 22:36:07,464 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 22:36:07,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 22:36:07,465 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 22:36:07,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 22:36:07,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 22:36:07,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 22:36:07,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 22:36:07,468 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 22:36:07,468 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 22:36:07,469 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 22:36:07,469 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 22:36:07,470 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 22:36:07,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 22:36:07,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 22:36:07,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 22:36:07,473 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 22:36:07,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 22:36:07,474 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 22:36:07,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 22:36:07,475 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 22:36:07,475 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 22:36:07,476 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 22:36:07,476 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 22:36:07,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 22:36:07,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 22:36:07,477 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 22:36:07,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 22:36:07,478 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 22:36:07,478 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 22:36:07,478 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 22:36:07,479 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 22:36:07,479 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 22:36:07,486 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 22:36:07,487 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 22:36:07,487 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 22:36:07,487 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 22:36:07,487 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 22:36:07,488 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 22:36:07,488 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 22:36:07,488 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 22:36:07,488 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 22:36:07,488 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 22:36:07,488 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 22:36:07,488 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 22:36:07,488 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 22:36:07,489 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 22:36:07,489 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 22:36:07,489 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 22:36:07,489 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 22:36:07,489 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 22:36:07,489 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 22:36:07,489 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 22:36:07,490 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 22:36:07,490 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 22:36:07,490 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 22:36:07,490 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 22:36:07,490 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 22:36:07,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 22:36:07,490 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 22:36:07,490 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 22:36:07,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:36:07,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 22:36:07,491 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 22:36:07,491 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 22:36:07,491 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 22:36:07,491 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 22:36:07,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 22:36:07,491 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 22:36:07,492 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_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-12-02 22:36:07,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 22:36:07,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 22:36:07,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 22:36:07,519 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 22:36:07,519 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 22:36:07,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 22:36:07,558 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/data/f67acc244/44bbed2e5ead439682f1ec9eb253c8ed/FLAG32587668d [2018-12-02 22:36:08,044 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 22:36:08,044 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 22:36:08,048 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/data/f67acc244/44bbed2e5ead439682f1ec9eb253c8ed/FLAG32587668d [2018-12-02 22:36:08,546 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/data/f67acc244/44bbed2e5ead439682f1ec9eb253c8ed [2018-12-02 22:36:08,548 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 22:36:08,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 22:36:08,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 22:36:08,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 22:36:08,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 22:36:08,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:36:08" (1/1) ... [2018-12-02 22:36:08,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2817da2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08, skipping insertion in model container [2018-12-02 22:36:08,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:36:08" (1/1) ... [2018-12-02 22:36:08,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 22:36:08,572 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 22:36:08,658 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:36:08,661 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 22:36:08,673 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:36:08,681 INFO L195 MainTranslator]: Completed translation [2018-12-02 22:36:08,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08 WrapperNode [2018-12-02 22:36:08,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 22:36:08,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 22:36:08,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 22:36:08,682 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 22:36:08,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08" (1/1) ... [2018-12-02 22:36:08,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08" (1/1) ... [2018-12-02 22:36:08,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 22:36:08,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 22:36:08,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 22:36:08,694 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 22:36:08,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08" (1/1) ... [2018-12-02 22:36:08,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08" (1/1) ... [2018-12-02 22:36:08,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08" (1/1) ... [2018-12-02 22:36:08,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08" (1/1) ... [2018-12-02 22:36:08,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08" (1/1) ... [2018-12-02 22:36:08,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08" (1/1) ... [2018-12-02 22:36:08,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08" (1/1) ... [2018-12-02 22:36:08,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 22:36:08,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 22:36:08,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 22:36:08,739 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 22:36:08,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:36:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 22:36:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 22:36:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 22:36:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 22:36:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 22:36:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 22:36:08,897 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 22:36:08,897 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 22:36:08,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:36:08 BoogieIcfgContainer [2018-12-02 22:36:08,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 22:36:08,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 22:36:08,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 22:36:08,900 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 22:36:08,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:36:08" (1/3) ... [2018-12-02 22:36:08,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22633b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:36:08, skipping insertion in model container [2018-12-02 22:36:08,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:08" (2/3) ... [2018-12-02 22:36:08,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22633b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:36:08, skipping insertion in model container [2018-12-02 22:36:08,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:36:08" (3/3) ... [2018-12-02 22:36:08,902 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 22:36:08,908 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 22:36:08,913 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 22:36:08,923 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 22:36:08,942 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 22:36:08,942 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 22:36:08,943 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 22:36:08,943 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 22:36:08,943 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 22:36:08,943 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 22:36:08,943 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 22:36:08,943 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 22:36:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-12-02 22:36:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 22:36:08,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:08,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:36:08,959 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:08,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:08,962 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2018-12-02 22:36:08,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:08,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:08,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:08,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:08,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,063 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,077 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-12-02 22:36:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,112 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2018-12-02 22:36:09,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-02 22:36:09,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,119 INFO L225 Difference]: With dead ends: 75 [2018-12-02 22:36:09,120 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 22:36:09,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-02 22:36:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 22:36:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-12-02 22:36:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 22:36:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2018-12-02 22:36:09,144 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2018-12-02 22:36:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,145 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2018-12-02 22:36:09,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,145 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2018-12-02 22:36:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 22:36:09,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:36:09,146 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2018-12-02 22:36:09,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,179 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2018-12-02 22:36:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,194 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2018-12-02 22:36:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-02 22:36:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,195 INFO L225 Difference]: With dead ends: 97 [2018-12-02 22:36:09,195 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 22:36:09,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 22:36:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-12-02 22:36:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 22:36:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2018-12-02 22:36:09,199 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2018-12-02 22:36:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,200 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2018-12-02 22:36:09,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2018-12-02 22:36:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 22:36:09,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:36:09,200 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2018-12-02 22:36:09,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,231 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2018-12-02 22:36:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,244 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-12-02 22:36:09,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 22:36:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,245 INFO L225 Difference]: With dead ends: 90 [2018-12-02 22:36:09,245 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 22:36:09,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 22:36:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-12-02 22:36:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 22:36:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2018-12-02 22:36:09,249 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2018-12-02 22:36:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,249 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2018-12-02 22:36:09,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2018-12-02 22:36:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 22:36:09,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:36:09,250 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2018-12-02 22:36:09,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,268 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2018-12-02 22:36:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,278 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2018-12-02 22:36:09,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 22:36:09,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,280 INFO L225 Difference]: With dead ends: 112 [2018-12-02 22:36:09,280 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 22:36:09,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 22:36:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2018-12-02 22:36:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-02 22:36:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2018-12-02 22:36:09,288 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2018-12-02 22:36:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,288 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2018-12-02 22:36:09,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2018-12-02 22:36:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 22:36:09,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:36:09,289 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2018-12-02 22:36:09,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,317 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2018-12-02 22:36:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,326 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2018-12-02 22:36:09,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 22:36:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,327 INFO L225 Difference]: With dead ends: 184 [2018-12-02 22:36:09,327 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 22:36:09,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 22:36:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-12-02 22:36:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-02 22:36:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2018-12-02 22:36:09,332 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2018-12-02 22:36:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,332 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2018-12-02 22:36:09,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2018-12-02 22:36:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 22:36:09,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,333 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-02 22:36:09,333 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,333 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2018-12-02 22:36:09,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,350 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2018-12-02 22:36:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,359 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2018-12-02 22:36:09,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 22:36:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,360 INFO L225 Difference]: With dead ends: 165 [2018-12-02 22:36:09,360 INFO L226 Difference]: Without dead ends: 114 [2018-12-02 22:36:09,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-02 22:36:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-12-02 22:36:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-02 22:36:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2018-12-02 22:36:09,366 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2018-12-02 22:36:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,366 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2018-12-02 22:36:09,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2018-12-02 22:36:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 22:36:09,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,366 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-02 22:36:09,367 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,367 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2018-12-02 22:36:09,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,386 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2018-12-02 22:36:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,405 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2018-12-02 22:36:09,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 22:36:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,406 INFO L225 Difference]: With dead ends: 204 [2018-12-02 22:36:09,406 INFO L226 Difference]: Without dead ends: 202 [2018-12-02 22:36:09,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-02 22:36:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2018-12-02 22:36:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 22:36:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2018-12-02 22:36:09,414 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2018-12-02 22:36:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,415 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2018-12-02 22:36:09,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2018-12-02 22:36:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 22:36:09,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,416 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-02 22:36:09,416 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2018-12-02 22:36:09,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,445 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2018-12-02 22:36:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,457 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2018-12-02 22:36:09,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 22:36:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,458 INFO L225 Difference]: With dead ends: 352 [2018-12-02 22:36:09,458 INFO L226 Difference]: Without dead ends: 210 [2018-12-02 22:36:09,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-02 22:36:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-12-02 22:36:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-02 22:36:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2018-12-02 22:36:09,468 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2018-12-02 22:36:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,468 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2018-12-02 22:36:09,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2018-12-02 22:36:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 22:36:09,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,469 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-02 22:36:09,469 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2018-12-02 22:36:09,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,484 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2018-12-02 22:36:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,496 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-12-02 22:36:09,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 22:36:09,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,497 INFO L225 Difference]: With dead ends: 312 [2018-12-02 22:36:09,497 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 22:36:09,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 22:36:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-12-02 22:36:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-02 22:36:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2018-12-02 22:36:09,504 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2018-12-02 22:36:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,504 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2018-12-02 22:36:09,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2018-12-02 22:36:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 22:36:09,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,505 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-02 22:36:09,505 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,505 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2018-12-02 22:36:09,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,525 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2018-12-02 22:36:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,539 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2018-12-02 22:36:09,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 22:36:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,541 INFO L225 Difference]: With dead ends: 380 [2018-12-02 22:36:09,541 INFO L226 Difference]: Without dead ends: 378 [2018-12-02 22:36:09,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-02 22:36:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2018-12-02 22:36:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-02 22:36:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2018-12-02 22:36:09,549 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2018-12-02 22:36:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,549 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2018-12-02 22:36:09,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2018-12-02 22:36:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 22:36:09,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,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] [2018-12-02 22:36:09,551 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,551 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2018-12-02 22:36:09,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,573 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2018-12-02 22:36:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,585 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2018-12-02 22:36:09,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 22:36:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,587 INFO L225 Difference]: With dead ends: 684 [2018-12-02 22:36:09,587 INFO L226 Difference]: Without dead ends: 402 [2018-12-02 22:36:09,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-02 22:36:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2018-12-02 22:36:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-02 22:36:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2018-12-02 22:36:09,598 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2018-12-02 22:36:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,598 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2018-12-02 22:36:09,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2018-12-02 22:36:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 22:36:09,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,599 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-02 22:36:09,599 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2018-12-02 22:36:09,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,614 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2018-12-02 22:36:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,636 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2018-12-02 22:36:09,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 22:36:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,638 INFO L225 Difference]: With dead ends: 600 [2018-12-02 22:36:09,638 INFO L226 Difference]: Without dead ends: 410 [2018-12-02 22:36:09,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-02 22:36:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-12-02 22:36:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-12-02 22:36:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2018-12-02 22:36:09,652 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2018-12-02 22:36:09,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,652 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2018-12-02 22:36:09,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2018-12-02 22:36:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 22:36:09,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,653 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-02 22:36:09,653 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2018-12-02 22:36:09,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,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-02 22:36:09,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,669 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2018-12-02 22:36:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,689 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2018-12-02 22:36:09,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 22:36:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,691 INFO L225 Difference]: With dead ends: 716 [2018-12-02 22:36:09,692 INFO L226 Difference]: Without dead ends: 714 [2018-12-02 22:36:09,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-12-02 22:36:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2018-12-02 22:36:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-12-02 22:36:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2018-12-02 22:36:09,711 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2018-12-02 22:36:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,712 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2018-12-02 22:36:09,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2018-12-02 22:36:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 22:36:09,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,713 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-02 22:36:09,714 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,714 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2018-12-02 22:36:09,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,728 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2018-12-02 22:36:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,754 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2018-12-02 22:36:09,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 22:36:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,756 INFO L225 Difference]: With dead ends: 1340 [2018-12-02 22:36:09,756 INFO L226 Difference]: Without dead ends: 778 [2018-12-02 22:36:09,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-12-02 22:36:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2018-12-02 22:36:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-12-02 22:36:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2018-12-02 22:36:09,783 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2018-12-02 22:36:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,783 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2018-12-02 22:36:09,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2018-12-02 22:36:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 22:36:09,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,785 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-02 22:36:09,785 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2018-12-02 22:36:09,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,801 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,802 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2018-12-02 22:36:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,824 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2018-12-02 22:36:09,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 22:36:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,827 INFO L225 Difference]: With dead ends: 1164 [2018-12-02 22:36:09,827 INFO L226 Difference]: Without dead ends: 794 [2018-12-02 22:36:09,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-12-02 22:36:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2018-12-02 22:36:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-12-02 22:36:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2018-12-02 22:36:09,845 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2018-12-02 22:36:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,845 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2018-12-02 22:36:09,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2018-12-02 22:36:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 22:36:09,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,846 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-02 22:36:09,846 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2018-12-02 22:36:09,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,861 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2018-12-02 22:36:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,894 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2018-12-02 22:36:09,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 22:36:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,897 INFO L225 Difference]: With dead ends: 1356 [2018-12-02 22:36:09,897 INFO L226 Difference]: Without dead ends: 1354 [2018-12-02 22:36:09,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-12-02 22:36:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2018-12-02 22:36:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-12-02 22:36:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2018-12-02 22:36:09,920 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2018-12-02 22:36:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:09,920 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2018-12-02 22:36:09,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2018-12-02 22:36:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 22:36:09,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:09,922 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-02 22:36:09,922 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:09,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:09,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2018-12-02 22:36:09,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:09,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:09,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:09,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:09,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:09,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:09,933 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:09,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:09,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:09,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,934 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2018-12-02 22:36:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:09,973 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2018-12-02 22:36:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:09,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 22:36:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:09,976 INFO L225 Difference]: With dead ends: 2636 [2018-12-02 22:36:09,977 INFO L226 Difference]: Without dead ends: 1514 [2018-12-02 22:36:09,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-12-02 22:36:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2018-12-02 22:36:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2018-12-02 22:36:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2018-12-02 22:36:10,012 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2018-12-02 22:36:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:10,012 INFO L480 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2018-12-02 22:36:10,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2018-12-02 22:36:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 22:36:10,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:10,014 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-02 22:36:10,014 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:10,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:10,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2018-12-02 22:36:10,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:10,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:10,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:10,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:10,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:10,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:10,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:10,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,025 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2018-12-02 22:36:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:10,070 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2018-12-02 22:36:10,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:10,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 22:36:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:10,074 INFO L225 Difference]: With dead ends: 2268 [2018-12-02 22:36:10,075 INFO L226 Difference]: Without dead ends: 1546 [2018-12-02 22:36:10,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-12-02 22:36:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2018-12-02 22:36:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-12-02 22:36:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2018-12-02 22:36:10,121 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2018-12-02 22:36:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:10,121 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2018-12-02 22:36:10,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2018-12-02 22:36:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 22:36:10,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:10,123 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-02 22:36:10,123 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:10,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:10,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2018-12-02 22:36:10,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:10,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:10,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:10,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:10,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:10,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:10,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,137 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2018-12-02 22:36:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:10,191 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2018-12-02 22:36:10,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:10,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 22:36:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:10,197 INFO L225 Difference]: With dead ends: 2572 [2018-12-02 22:36:10,198 INFO L226 Difference]: Without dead ends: 2570 [2018-12-02 22:36:10,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2018-12-02 22:36:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2018-12-02 22:36:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-12-02 22:36:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2018-12-02 22:36:10,251 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2018-12-02 22:36:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:10,251 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2018-12-02 22:36:10,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2018-12-02 22:36:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 22:36:10,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:10,253 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-02 22:36:10,253 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:10,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2018-12-02 22:36:10,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:10,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:10,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:10,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:10,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:10,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:10,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:10,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:10,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,265 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2018-12-02 22:36:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:10,336 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2018-12-02 22:36:10,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:10,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 22:36:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:10,341 INFO L225 Difference]: With dead ends: 5196 [2018-12-02 22:36:10,341 INFO L226 Difference]: Without dead ends: 2954 [2018-12-02 22:36:10,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-12-02 22:36:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2018-12-02 22:36:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2018-12-02 22:36:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2018-12-02 22:36:10,398 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2018-12-02 22:36:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:10,398 INFO L480 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2018-12-02 22:36:10,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2018-12-02 22:36:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 22:36:10,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:10,401 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-02 22:36:10,401 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:10,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:10,401 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2018-12-02 22:36:10,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:10,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:10,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:10,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:10,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:10,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:10,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:10,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:10,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,411 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2018-12-02 22:36:10,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:10,466 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2018-12-02 22:36:10,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:10,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 22:36:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:10,473 INFO L225 Difference]: With dead ends: 4428 [2018-12-02 22:36:10,474 INFO L226 Difference]: Without dead ends: 3018 [2018-12-02 22:36:10,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2018-12-02 22:36:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2018-12-02 22:36:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-12-02 22:36:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2018-12-02 22:36:10,536 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2018-12-02 22:36:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:10,536 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2018-12-02 22:36:10,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2018-12-02 22:36:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 22:36:10,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:10,539 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-02 22:36:10,539 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:10,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2018-12-02 22:36:10,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:10,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:10,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:10,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:10,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:10,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:10,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,549 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2018-12-02 22:36:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:10,634 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2018-12-02 22:36:10,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:10,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 22:36:10,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:10,639 INFO L225 Difference]: With dead ends: 8650 [2018-12-02 22:36:10,640 INFO L226 Difference]: Without dead ends: 3016 [2018-12-02 22:36:10,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-12-02 22:36:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2018-12-02 22:36:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-12-02 22:36:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2018-12-02 22:36:10,706 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2018-12-02 22:36:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:10,706 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2018-12-02 22:36:10,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-12-02 22:36:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 22:36:10,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:36:10,709 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-02 22:36:10,709 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:36:10,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2018-12-02 22:36:10,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:36:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:10,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:36:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:10,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:10,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:36:10,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:36:10,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:36:10,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:36:10,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,721 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2018-12-02 22:36:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:10,765 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-12-02 22:36:10,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:36:10,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 22:36:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:36:10,766 INFO L225 Difference]: With dead ends: 3016 [2018-12-02 22:36:10,766 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 22:36:10,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:36:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 22:36:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 22:36:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 22:36:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 22:36:10,769 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-12-02 22:36:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:36:10,769 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 22:36:10,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:36:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 22:36:10,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 22:36:10,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 22:36:10,787 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 22:36:10,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 22:36:10,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 22:36:10,787 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 22:36:10,787 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 22:36:10,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 22:36:10,787 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-12-02 22:36:10,788 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-12-02 22:36:10,788 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,788 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-12-02 22:36:10,788 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,788 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-12-02 22:36:10,788 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,788 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,788 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-12-02 22:36:10,788 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-12-02 22:36:10,788 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-02 22:36:10,788 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L451 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-12-02 22:36:10,789 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,790 INFO L451 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-12-02 22:36:10,790 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,790 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,790 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-12-02 22:36:10,790 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-12-02 22:36:10,790 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:36:10,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:36:10 BoogieIcfgContainer [2018-12-02 22:36:10,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 22:36:10,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 22:36:10,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 22:36:10,796 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 22:36:10,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:36:08" (3/4) ... [2018-12-02 22:36:10,799 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 22:36:10,805 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 22:36:10,805 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 22:36:10,809 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 22:36:10,809 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 22:36:10,809 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 22:36:10,845 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9ad1357b-bf19-4703-96d3-3c3e582d8c4a/bin-2019/utaipan/witness.graphml [2018-12-02 22:36:10,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 22:36:10,846 INFO L168 Benchmark]: Toolchain (without parser) took 2297.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.8 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-12-02 22:36:10,847 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:36:10,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.91 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 22:36:10,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.06 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:36:10,847 INFO L168 Benchmark]: Boogie Preprocessor took 44.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-02 22:36:10,848 INFO L168 Benchmark]: RCFGBuilder took 158.54 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: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-12-02 22:36:10,848 INFO L168 Benchmark]: TraceAbstraction took 1897.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -25.5 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-12-02 22:36:10,848 INFO L168 Benchmark]: Witness Printer took 49.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-02 22:36:10,850 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 131.91 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.06 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 158.54 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: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1897.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -25.5 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * Witness Printer took 49.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 38 locations, 1 error locations. SAFE Result, 1.8s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, 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: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...