./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i --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_fa34d999-ade8-499e-b6a4-a978db98840a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/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 17cb67016a37b4d6ca4d07f4518c2ed6beef643f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 02:43:52,443 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:43:52,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:43:52,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:43:52,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:43:52,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:43:52,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:43:52,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:43:52,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:43:52,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:43:52,455 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:43:52,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:43:52,455 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:43:52,456 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:43:52,456 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:43:52,457 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:43:52,457 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:43:52,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:43:52,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:43:52,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:43:52,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:43:52,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:43:52,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:43:52,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:43:52,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:43:52,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:43:52,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:43:52,464 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:43:52,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:43:52,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:43:52,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:43:52,465 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:43:52,465 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:43:52,466 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:43:52,466 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:43:52,466 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:43:52,467 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 02:43:52,474 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:43:52,474 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:43:52,475 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:43:52,475 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:43:52,475 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 02:43:52,475 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 02:43:52,475 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 02:43:52,475 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 02:43:52,475 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 02:43:52,476 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 02:43:52,476 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 02:43:52,476 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 02:43:52,476 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 02:43:52,476 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:43:52,476 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:43:52,476 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:43:52,477 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:43:52,477 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:43:52,477 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:43:52,477 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:43:52,477 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:43:52,477 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:43:52,477 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:43:52,477 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:43:52,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:43:52,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:43:52,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:43:52,478 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:43:52,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:43:52,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:43:52,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:43:52,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:43:52,478 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 02:43:52,478 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:43:52,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:43:52,478 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 02:43:52,478 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_fa34d999-ade8-499e-b6a4-a978db98840a/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 -> 17cb67016a37b4d6ca4d07f4518c2ed6beef643f [2018-12-02 02:43:52,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:43:52,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:43:52,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:43:52,505 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:43:52,505 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:43:52,506 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/bin-2019/utaipan/../../sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2018-12-02 02:43:52,540 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/bin-2019/utaipan/data/5cc79c943/fe3fc11cdf0648ca8217e9f11f5245dc/FLAG1b6ccdddc [2018-12-02 02:43:52,923 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:43:52,924 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2018-12-02 02:43:52,932 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/bin-2019/utaipan/data/5cc79c943/fe3fc11cdf0648ca8217e9f11f5245dc/FLAG1b6ccdddc [2018-12-02 02:43:53,278 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/bin-2019/utaipan/data/5cc79c943/fe3fc11cdf0648ca8217e9f11f5245dc [2018-12-02 02:43:53,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:43:53,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:43:53,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:43:53,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:43:53,288 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:43:53,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b62dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53, skipping insertion in model container [2018-12-02 02:43:53,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:43:53,321 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:43:53,562 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:43:53,570 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:43:53,637 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:43:53,728 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:43:53,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53 WrapperNode [2018-12-02 02:43:53,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:43:53,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:43:53,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:43:53,729 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:43:53,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:43:53,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:43:53,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:43:53,758 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:43:53,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:43:53,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:43:53,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:43:53,774 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:43:53,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/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 02:43:53,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:43:53,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:43:53,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 02:43:53,808 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2018-12-02 02:43:53,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2018-12-02 02:43:53,808 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2018-12-02 02:43:53,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2018-12-02 02:43:53,808 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2018-12-02 02:43:53,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2018-12-02 02:43:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2018-12-02 02:43:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2018-12-02 02:43:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 02:43:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:43:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:43:53,810 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 02:43:54,011 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:43:54,011 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 02:43:54,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:43:54 BoogieIcfgContainer [2018-12-02 02:43:54,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:43:54,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:43:54,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:43:54,015 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:43:54,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:43:53" (1/3) ... [2018-12-02 02:43:54,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420cded5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:43:54, skipping insertion in model container [2018-12-02 02:43:54,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (2/3) ... [2018-12-02 02:43:54,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420cded5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:43:54, skipping insertion in model container [2018-12-02 02:43:54,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:43:54" (3/3) ... [2018-12-02 02:43:54,017 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems_true-unreach-call.i [2018-12-02 02:43:54,051 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,051 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,051 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,051 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,051 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,051 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,052 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,052 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,052 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,052 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,052 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,052 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,053 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,053 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,053 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,053 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,053 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,054 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,054 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,054 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,055 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,055 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,055 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,055 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,055 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,055 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,056 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,056 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,056 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,056 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,056 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,057 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,057 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,057 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,057 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,057 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,058 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,058 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,058 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,058 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,058 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,058 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,059 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,059 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,059 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,059 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,059 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,059 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,060 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,060 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,060 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,060 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,060 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,060 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,061 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,061 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,061 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,061 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,061 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,061 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,062 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,062 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,062 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,062 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,062 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,062 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,063 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,063 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,063 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,063 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,063 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,063 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,063 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,064 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,064 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,064 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,064 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,064 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,064 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,065 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,065 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,065 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,065 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,066 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,066 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,066 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,066 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,066 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,067 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,067 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,067 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,067 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,168 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 02:43:54,168 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:43:54,173 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 02:43:54,182 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 02:43:54,197 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:43:54,197 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 02:43:54,197 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:43:54,197 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:43:54,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:43:54,198 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:43:54,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:43:54,198 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:43:54,204 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 239 transitions [2018-12-02 02:43:57,561 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 60962 states. [2018-12-02 02:43:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 60962 states. [2018-12-02 02:43:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 02:43:57,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:43:57,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:43:57,571 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:43:57,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:43:57,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1451762756, now seen corresponding path program 1 times [2018-12-02 02:43:57,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:43:57,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:57,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:43:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:57,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:43:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:43:57,717 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 02:43:57,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:43:57,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:43:57,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:43:57,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:43:57,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:43:57,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:43:57,738 INFO L87 Difference]: Start difference. First operand 60962 states. Second operand 5 states. [2018-12-02 02:43:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:43:58,329 INFO L93 Difference]: Finished difference Result 90537 states and 379072 transitions. [2018-12-02 02:43:58,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:43:58,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-02 02:43:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:43:58,480 INFO L225 Difference]: With dead ends: 90537 [2018-12-02 02:43:58,480 INFO L226 Difference]: Without dead ends: 40487 [2018-12-02 02:43:58,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:43:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40487 states. [2018-12-02 02:43:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40487 to 40487. [2018-12-02 02:43:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40487 states. [2018-12-02 02:43:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40487 states to 40487 states and 173218 transitions. [2018-12-02 02:43:59,331 INFO L78 Accepts]: Start accepts. Automaton has 40487 states and 173218 transitions. Word has length 33 [2018-12-02 02:43:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:43:59,332 INFO L480 AbstractCegarLoop]: Abstraction has 40487 states and 173218 transitions. [2018-12-02 02:43:59,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:43:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 40487 states and 173218 transitions. [2018-12-02 02:43:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 02:43:59,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:43:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:43:59,334 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:43:59,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:43:59,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1742157727, now seen corresponding path program 1 times [2018-12-02 02:43:59,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:43:59,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:59,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:43:59,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:59,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:43:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:43:59,446 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 02:43:59,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:43:59,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 02:43:59,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:43:59,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 02:43:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:43:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:43:59,449 INFO L87 Difference]: Start difference. First operand 40487 states and 173218 transitions. Second operand 10 states. [2018-12-02 02:43:59,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:43:59,921 INFO L93 Difference]: Finished difference Result 47144 states and 204499 transitions. [2018-12-02 02:43:59,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:43:59,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-02 02:43:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:00,228 INFO L225 Difference]: With dead ends: 47144 [2018-12-02 02:44:00,228 INFO L226 Difference]: Without dead ends: 47144 [2018-12-02 02:44:00,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 02:44:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47144 states. [2018-12-02 02:44:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47144 to 40505. [2018-12-02 02:44:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40505 states. [2018-12-02 02:44:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40505 states to 40505 states and 173247 transitions. [2018-12-02 02:44:00,868 INFO L78 Accepts]: Start accepts. Automaton has 40505 states and 173247 transitions. Word has length 35 [2018-12-02 02:44:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:00,869 INFO L480 AbstractCegarLoop]: Abstraction has 40505 states and 173247 transitions. [2018-12-02 02:44:00,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 02:44:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 40505 states and 173247 transitions. [2018-12-02 02:44:00,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 02:44:00,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:00,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:00,870 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:00,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:00,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1856245215, now seen corresponding path program 2 times [2018-12-02 02:44:00,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:00,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:00,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:00,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:00,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:00,960 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 02:44:00,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:00,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 02:44:00,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:00,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 02:44:00,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:44:00,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:44:00,961 INFO L87 Difference]: Start difference. First operand 40505 states and 173247 transitions. Second operand 10 states. [2018-12-02 02:44:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:01,545 INFO L93 Difference]: Finished difference Result 53745 states and 235686 transitions. [2018-12-02 02:44:01,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 02:44:01,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-02 02:44:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:01,659 INFO L225 Difference]: With dead ends: 53745 [2018-12-02 02:44:01,659 INFO L226 Difference]: Without dead ends: 53745 [2018-12-02 02:44:01,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:44:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53745 states. [2018-12-02 02:44:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53745 to 40451. [2018-12-02 02:44:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40451 states. [2018-12-02 02:44:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40451 states to 40451 states and 173155 transitions. [2018-12-02 02:44:02,394 INFO L78 Accepts]: Start accepts. Automaton has 40451 states and 173155 transitions. Word has length 35 [2018-12-02 02:44:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:02,394 INFO L480 AbstractCegarLoop]: Abstraction has 40451 states and 173155 transitions. [2018-12-02 02:44:02,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 02:44:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 40451 states and 173155 transitions. [2018-12-02 02:44:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 02:44:02,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:02,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:02,406 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:02,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:02,406 INFO L82 PathProgramCache]: Analyzing trace with hash 864239609, now seen corresponding path program 1 times [2018-12-02 02:44:02,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:02,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:02,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:44:02,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:02,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:44:02,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:02,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:44:02,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:02,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:44:02,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:44:02,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:44:02,458 INFO L87 Difference]: Start difference. First operand 40451 states and 173155 transitions. Second operand 5 states. [2018-12-02 02:44:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:02,969 INFO L93 Difference]: Finished difference Result 74947 states and 314581 transitions. [2018-12-02 02:44:02,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:44:02,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-02 02:44:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:03,110 INFO L225 Difference]: With dead ends: 74947 [2018-12-02 02:44:03,110 INFO L226 Difference]: Without dead ends: 56513 [2018-12-02 02:44:03,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:44:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56513 states. [2018-12-02 02:44:03,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56513 to 40763. [2018-12-02 02:44:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40763 states. [2018-12-02 02:44:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40763 states to 40763 states and 169305 transitions. [2018-12-02 02:44:03,825 INFO L78 Accepts]: Start accepts. Automaton has 40763 states and 169305 transitions. Word has length 45 [2018-12-02 02:44:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:03,826 INFO L480 AbstractCegarLoop]: Abstraction has 40763 states and 169305 transitions. [2018-12-02 02:44:03,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:44:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 40763 states and 169305 transitions. [2018-12-02 02:44:03,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 02:44:03,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:03,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:03,839 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:03,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:03,839 INFO L82 PathProgramCache]: Analyzing trace with hash 238055866, now seen corresponding path program 1 times [2018-12-02 02:44:03,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:03,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:03,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:03,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:03,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:04,205 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 02:44:04,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:04,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 02:44:04,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:04,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:44:04,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:44:04,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:44:04,206 INFO L87 Difference]: Start difference. First operand 40763 states and 169305 transitions. Second operand 19 states. [2018-12-02 02:44:04,911 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-12-02 02:44:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:05,953 INFO L93 Difference]: Finished difference Result 58950 states and 239857 transitions. [2018-12-02 02:44:05,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 02:44:05,953 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-12-02 02:44:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:06,063 INFO L225 Difference]: With dead ends: 58950 [2018-12-02 02:44:06,064 INFO L226 Difference]: Without dead ends: 56542 [2018-12-02 02:44:06,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 02:44:06,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56542 states. [2018-12-02 02:44:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56542 to 40733. [2018-12-02 02:44:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40733 states. [2018-12-02 02:44:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40733 states to 40733 states and 169201 transitions. [2018-12-02 02:44:06,800 INFO L78 Accepts]: Start accepts. Automaton has 40733 states and 169201 transitions. Word has length 47 [2018-12-02 02:44:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:06,800 INFO L480 AbstractCegarLoop]: Abstraction has 40733 states and 169201 transitions. [2018-12-02 02:44:06,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:44:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 40733 states and 169201 transitions. [2018-12-02 02:44:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 02:44:06,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:06,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:06,813 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:06,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash 565489518, now seen corresponding path program 2 times [2018-12-02 02:44:06,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:06,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:06,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:06,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:06,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:06,872 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 02:44:06,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:06,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 02:44:06,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:06,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 02:44:06,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 02:44:06,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:44:06,873 INFO L87 Difference]: Start difference. First operand 40733 states and 169201 transitions. Second operand 9 states. [2018-12-02 02:44:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:07,249 INFO L93 Difference]: Finished difference Result 58841 states and 239535 transitions. [2018-12-02 02:44:07,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 02:44:07,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-12-02 02:44:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:07,359 INFO L225 Difference]: With dead ends: 58841 [2018-12-02 02:44:07,360 INFO L226 Difference]: Without dead ends: 56433 [2018-12-02 02:44:07,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:44:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56433 states. [2018-12-02 02:44:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56433 to 40658. [2018-12-02 02:44:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40658 states. [2018-12-02 02:44:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40658 states to 40658 states and 168991 transitions. [2018-12-02 02:44:08,244 INFO L78 Accepts]: Start accepts. Automaton has 40658 states and 168991 transitions. Word has length 47 [2018-12-02 02:44:08,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:08,244 INFO L480 AbstractCegarLoop]: Abstraction has 40658 states and 168991 transitions. [2018-12-02 02:44:08,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 02:44:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 40658 states and 168991 transitions. [2018-12-02 02:44:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 02:44:08,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:08,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:08,260 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:08,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:08,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1318988660, now seen corresponding path program 1 times [2018-12-02 02:44:08,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:08,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:08,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:44:08,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:08,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:08,313 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 02:44:08,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:08,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:44:08,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:08,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:44:08,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:44:08,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:44:08,314 INFO L87 Difference]: Start difference. First operand 40658 states and 168991 transitions. Second operand 7 states. [2018-12-02 02:44:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:08,706 INFO L93 Difference]: Finished difference Result 71197 states and 287728 transitions. [2018-12-02 02:44:08,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 02:44:08,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-02 02:44:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:08,798 INFO L225 Difference]: With dead ends: 71197 [2018-12-02 02:44:08,799 INFO L226 Difference]: Without dead ends: 48359 [2018-12-02 02:44:08,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-02 02:44:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48359 states. [2018-12-02 02:44:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48359 to 42374. [2018-12-02 02:44:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42374 states. [2018-12-02 02:44:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42374 states to 42374 states and 171196 transitions. [2018-12-02 02:44:09,486 INFO L78 Accepts]: Start accepts. Automaton has 42374 states and 171196 transitions. Word has length 48 [2018-12-02 02:44:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:09,487 INFO L480 AbstractCegarLoop]: Abstraction has 42374 states and 171196 transitions. [2018-12-02 02:44:09,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:44:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 42374 states and 171196 transitions. [2018-12-02 02:44:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 02:44:09,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:09,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:09,511 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:09,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:09,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1778320058, now seen corresponding path program 1 times [2018-12-02 02:44:09,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:09,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:09,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:09,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:09,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:09,660 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 02:44:09,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:09,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 02:44:09,660 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:09,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 02:44:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 02:44:09,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:44:09,661 INFO L87 Difference]: Start difference. First operand 42374 states and 171196 transitions. Second operand 13 states. [2018-12-02 02:44:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:10,115 INFO L93 Difference]: Finished difference Result 54161 states and 215849 transitions. [2018-12-02 02:44:10,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 02:44:10,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-12-02 02:44:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:10,214 INFO L225 Difference]: With dead ends: 54161 [2018-12-02 02:44:10,214 INFO L226 Difference]: Without dead ends: 50905 [2018-12-02 02:44:10,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-12-02 02:44:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50905 states. [2018-12-02 02:44:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50905 to 42044. [2018-12-02 02:44:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42044 states. [2018-12-02 02:44:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42044 states to 42044 states and 169930 transitions. [2018-12-02 02:44:11,004 INFO L78 Accepts]: Start accepts. Automaton has 42044 states and 169930 transitions. Word has length 50 [2018-12-02 02:44:11,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:11,005 INFO L480 AbstractCegarLoop]: Abstraction has 42044 states and 169930 transitions. [2018-12-02 02:44:11,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 02:44:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 42044 states and 169930 transitions. [2018-12-02 02:44:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 02:44:11,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:11,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:11,029 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:11,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:11,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1136732819, now seen corresponding path program 1 times [2018-12-02 02:44:11,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:11,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:11,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:11,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:11,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:11,338 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 02:44:11,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:11,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 02:44:11,338 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:11,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 02:44:11,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 02:44:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:44:11,339 INFO L87 Difference]: Start difference. First operand 42044 states and 169930 transitions. Second operand 17 states. [2018-12-02 02:44:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:12,191 INFO L93 Difference]: Finished difference Result 48342 states and 195029 transitions. [2018-12-02 02:44:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 02:44:12,191 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-12-02 02:44:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:12,280 INFO L225 Difference]: With dead ends: 48342 [2018-12-02 02:44:12,280 INFO L226 Difference]: Without dead ends: 47886 [2018-12-02 02:44:12,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2018-12-02 02:44:12,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47886 states. [2018-12-02 02:44:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47886 to 45629. [2018-12-02 02:44:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45629 states. [2018-12-02 02:44:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45629 states to 45629 states and 185453 transitions. [2018-12-02 02:44:12,976 INFO L78 Accepts]: Start accepts. Automaton has 45629 states and 185453 transitions. Word has length 50 [2018-12-02 02:44:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:12,976 INFO L480 AbstractCegarLoop]: Abstraction has 45629 states and 185453 transitions. [2018-12-02 02:44:12,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 02:44:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 45629 states and 185453 transitions. [2018-12-02 02:44:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 02:44:13,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:13,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:13,003 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:13,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1695764147, now seen corresponding path program 2 times [2018-12-02 02:44:13,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:13,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:13,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:13,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:13,179 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 02:44:13,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:13,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 02:44:13,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:13,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 02:44:13,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 02:44:13,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-02 02:44:13,180 INFO L87 Difference]: Start difference. First operand 45629 states and 185453 transitions. Second operand 14 states. [2018-12-02 02:44:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:13,674 INFO L93 Difference]: Finished difference Result 56333 states and 228138 transitions. [2018-12-02 02:44:13,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 02:44:13,675 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-02 02:44:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:13,784 INFO L225 Difference]: With dead ends: 56333 [2018-12-02 02:44:13,784 INFO L226 Difference]: Without dead ends: 55877 [2018-12-02 02:44:13,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-12-02 02:44:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55877 states. [2018-12-02 02:44:14,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55877 to 45508. [2018-12-02 02:44:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45508 states. [2018-12-02 02:44:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45508 states to 45508 states and 185108 transitions. [2018-12-02 02:44:14,759 INFO L78 Accepts]: Start accepts. Automaton has 45508 states and 185108 transitions. Word has length 50 [2018-12-02 02:44:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:14,759 INFO L480 AbstractCegarLoop]: Abstraction has 45508 states and 185108 transitions. [2018-12-02 02:44:14,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 02:44:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 45508 states and 185108 transitions. [2018-12-02 02:44:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 02:44:14,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:14,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:14,784 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:14,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:14,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1546975859, now seen corresponding path program 1 times [2018-12-02 02:44:14,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:14,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:14,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:44:14,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:14,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:14,852 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 02:44:14,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:14,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 02:44:14,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:14,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 02:44:14,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 02:44:14,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:44:14,853 INFO L87 Difference]: Start difference. First operand 45508 states and 185108 transitions. Second operand 11 states. [2018-12-02 02:44:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:15,276 INFO L93 Difference]: Finished difference Result 56707 states and 227522 transitions. [2018-12-02 02:44:15,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 02:44:15,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-12-02 02:44:15,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:15,374 INFO L225 Difference]: With dead ends: 56707 [2018-12-02 02:44:15,374 INFO L226 Difference]: Without dead ends: 51132 [2018-12-02 02:44:15,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2018-12-02 02:44:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51132 states. [2018-12-02 02:44:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51132 to 44908. [2018-12-02 02:44:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44908 states. [2018-12-02 02:44:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44908 states to 44908 states and 182813 transitions. [2018-12-02 02:44:16,084 INFO L78 Accepts]: Start accepts. Automaton has 44908 states and 182813 transitions. Word has length 50 [2018-12-02 02:44:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:16,085 INFO L480 AbstractCegarLoop]: Abstraction has 44908 states and 182813 transitions. [2018-12-02 02:44:16,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 02:44:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 44908 states and 182813 transitions. [2018-12-02 02:44:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 02:44:16,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:16,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:16,117 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:16,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash -295598450, now seen corresponding path program 1 times [2018-12-02 02:44:16,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:16,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:16,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:16,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:16,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:16,481 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 02:44:16,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:16,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 02:44:16,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:16,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 02:44:16,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 02:44:16,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:44:16,482 INFO L87 Difference]: Start difference. First operand 44908 states and 182813 transitions. Second operand 17 states. [2018-12-02 02:44:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:18,079 INFO L93 Difference]: Finished difference Result 55621 states and 226438 transitions. [2018-12-02 02:44:18,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 02:44:18,080 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-12-02 02:44:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:18,187 INFO L225 Difference]: With dead ends: 55621 [2018-12-02 02:44:18,187 INFO L226 Difference]: Without dead ends: 55165 [2018-12-02 02:44:18,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2018-12-02 02:44:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55165 states. [2018-12-02 02:44:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55165 to 44721. [2018-12-02 02:44:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44721 states. [2018-12-02 02:44:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44721 states to 44721 states and 182302 transitions. [2018-12-02 02:44:19,115 INFO L78 Accepts]: Start accepts. Automaton has 44721 states and 182302 transitions. Word has length 52 [2018-12-02 02:44:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:19,116 INFO L480 AbstractCegarLoop]: Abstraction has 44721 states and 182302 transitions. [2018-12-02 02:44:19,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 02:44:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 44721 states and 182302 transitions. [2018-12-02 02:44:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 02:44:19,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:19,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:19,149 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:19,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:19,149 INFO L82 PathProgramCache]: Analyzing trace with hash 897864341, now seen corresponding path program 1 times [2018-12-02 02:44:19,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:19,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:19,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:19,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:19,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:19,334 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 02:44:19,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:19,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-02 02:44:19,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:19,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 02:44:19,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 02:44:19,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-12-02 02:44:19,334 INFO L87 Difference]: Start difference. First operand 44721 states and 182302 transitions. Second operand 15 states. [2018-12-02 02:44:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:19,801 INFO L93 Difference]: Finished difference Result 52211 states and 210162 transitions. [2018-12-02 02:44:19,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 02:44:19,801 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-12-02 02:44:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:19,881 INFO L225 Difference]: With dead ends: 52211 [2018-12-02 02:44:19,881 INFO L226 Difference]: Without dead ends: 43294 [2018-12-02 02:44:19,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2018-12-02 02:44:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43294 states. [2018-12-02 02:44:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43294 to 37956. [2018-12-02 02:44:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37956 states. [2018-12-02 02:44:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37956 states to 37956 states and 153296 transitions. [2018-12-02 02:44:20,476 INFO L78 Accepts]: Start accepts. Automaton has 37956 states and 153296 transitions. Word has length 53 [2018-12-02 02:44:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:20,476 INFO L480 AbstractCegarLoop]: Abstraction has 37956 states and 153296 transitions. [2018-12-02 02:44:20,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 02:44:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 37956 states and 153296 transitions. [2018-12-02 02:44:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 02:44:20,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:20,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:20,504 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:20,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:20,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1410636712, now seen corresponding path program 1 times [2018-12-02 02:44:20,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:20,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:20,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:20,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:20,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:20,638 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 02:44:20,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:20,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 02:44:20,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:20,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 02:44:20,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 02:44:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:44:20,639 INFO L87 Difference]: Start difference. First operand 37956 states and 153296 transitions. Second operand 13 states. [2018-12-02 02:44:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:21,170 INFO L93 Difference]: Finished difference Result 46513 states and 186428 transitions. [2018-12-02 02:44:21,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 02:44:21,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-12-02 02:44:21,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:21,247 INFO L225 Difference]: With dead ends: 46513 [2018-12-02 02:44:21,247 INFO L226 Difference]: Without dead ends: 38243 [2018-12-02 02:44:21,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2018-12-02 02:44:21,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38243 states. [2018-12-02 02:44:21,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38243 to 32694. [2018-12-02 02:44:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32694 states. [2018-12-02 02:44:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 131852 transitions. [2018-12-02 02:44:21,780 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 131852 transitions. Word has length 53 [2018-12-02 02:44:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:21,780 INFO L480 AbstractCegarLoop]: Abstraction has 32694 states and 131852 transitions. [2018-12-02 02:44:21,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 02:44:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 131852 transitions. [2018-12-02 02:44:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:44:21,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:21,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:21,805 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:21,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:21,805 INFO L82 PathProgramCache]: Analyzing trace with hash -142833368, now seen corresponding path program 1 times [2018-12-02 02:44:21,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:21,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:21,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:21,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:21,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:22,188 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 02:44:22,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:22,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 02:44:22,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:22,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:44:22,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:44:22,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:44:22,189 INFO L87 Difference]: Start difference. First operand 32694 states and 131852 transitions. Second operand 19 states. [2018-12-02 02:44:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:22,910 INFO L93 Difference]: Finished difference Result 37734 states and 151509 transitions. [2018-12-02 02:44:22,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 02:44:22,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-02 02:44:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:22,977 INFO L225 Difference]: With dead ends: 37734 [2018-12-02 02:44:22,978 INFO L226 Difference]: Without dead ends: 37293 [2018-12-02 02:44:22,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2018-12-02 02:44:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37293 states. [2018-12-02 02:44:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37293 to 34905. [2018-12-02 02:44:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34905 states. [2018-12-02 02:44:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34905 states to 34905 states and 140988 transitions. [2018-12-02 02:44:23,503 INFO L78 Accepts]: Start accepts. Automaton has 34905 states and 140988 transitions. Word has length 55 [2018-12-02 02:44:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:23,503 INFO L480 AbstractCegarLoop]: Abstraction has 34905 states and 140988 transitions. [2018-12-02 02:44:23,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:44:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 34905 states and 140988 transitions. [2018-12-02 02:44:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:44:23,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:23,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:23,531 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:23,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash -51175185, now seen corresponding path program 1 times [2018-12-02 02:44:23,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:23,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:23,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:23,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:23,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:23,927 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 02:44:23,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:23,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 02:44:23,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:23,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:44:23,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:44:23,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:44:23,928 INFO L87 Difference]: Start difference. First operand 34905 states and 140988 transitions. Second operand 19 states. [2018-12-02 02:44:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:24,786 INFO L93 Difference]: Finished difference Result 38941 states and 156506 transitions. [2018-12-02 02:44:24,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 02:44:24,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-02 02:44:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:24,853 INFO L225 Difference]: With dead ends: 38941 [2018-12-02 02:44:24,853 INFO L226 Difference]: Without dead ends: 38614 [2018-12-02 02:44:24,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2018-12-02 02:44:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38614 states. [2018-12-02 02:44:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38614 to 34635. [2018-12-02 02:44:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2018-12-02 02:44:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 139908 transitions. [2018-12-02 02:44:25,368 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 139908 transitions. Word has length 55 [2018-12-02 02:44:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:25,368 INFO L480 AbstractCegarLoop]: Abstraction has 34635 states and 139908 transitions. [2018-12-02 02:44:25,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:44:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 139908 transitions. [2018-12-02 02:44:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:44:25,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:25,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:25,395 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:25,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1740514353, now seen corresponding path program 2 times [2018-12-02 02:44:25,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:25,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:25,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:25,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:25,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:25,954 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 02:44:25,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:25,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 02:44:25,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:25,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:44:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:44:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:44:25,955 INFO L87 Difference]: Start difference. First operand 34635 states and 139908 transitions. Second operand 19 states. [2018-12-02 02:44:26,959 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-12-02 02:44:27,146 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2018-12-02 02:44:27,414 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2018-12-02 02:44:27,586 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2018-12-02 02:44:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:28,458 INFO L93 Difference]: Finished difference Result 39529 states and 158826 transitions. [2018-12-02 02:44:28,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 02:44:28,458 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-02 02:44:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:28,528 INFO L225 Difference]: With dead ends: 39529 [2018-12-02 02:44:28,528 INFO L226 Difference]: Without dead ends: 39082 [2018-12-02 02:44:28,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 02:44:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39082 states. [2018-12-02 02:44:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39082 to 34575. [2018-12-02 02:44:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34575 states. [2018-12-02 02:44:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34575 states to 34575 states and 139640 transitions. [2018-12-02 02:44:29,070 INFO L78 Accepts]: Start accepts. Automaton has 34575 states and 139640 transitions. Word has length 55 [2018-12-02 02:44:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:29,070 INFO L480 AbstractCegarLoop]: Abstraction has 34575 states and 139640 transitions. [2018-12-02 02:44:29,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:44:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 34575 states and 139640 transitions. [2018-12-02 02:44:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:44:29,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:29,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:29,099 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:29,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1858563217, now seen corresponding path program 3 times [2018-12-02 02:44:29,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:29,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:29,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:44:29,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:29,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:29,502 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 02:44:29,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:29,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 02:44:29,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:29,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 02:44:29,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 02:44:29,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-02 02:44:29,503 INFO L87 Difference]: Start difference. First operand 34575 states and 139640 transitions. Second operand 18 states. [2018-12-02 02:44:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:30,451 INFO L93 Difference]: Finished difference Result 39179 states and 157389 transitions. [2018-12-02 02:44:30,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 02:44:30,451 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-12-02 02:44:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:30,520 INFO L225 Difference]: With dead ends: 39179 [2018-12-02 02:44:30,520 INFO L226 Difference]: Without dead ends: 38714 [2018-12-02 02:44:30,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2018-12-02 02:44:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38714 states. [2018-12-02 02:44:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38714 to 34551. [2018-12-02 02:44:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34551 states. [2018-12-02 02:44:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34551 states to 34551 states and 139552 transitions. [2018-12-02 02:44:31,059 INFO L78 Accepts]: Start accepts. Automaton has 34551 states and 139552 transitions. Word has length 55 [2018-12-02 02:44:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:31,059 INFO L480 AbstractCegarLoop]: Abstraction has 34551 states and 139552 transitions. [2018-12-02 02:44:31,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 02:44:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 34551 states and 139552 transitions. [2018-12-02 02:44:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:44:31,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:31,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:31,086 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:31,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:31,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1655779279, now seen corresponding path program 4 times [2018-12-02 02:44:31,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:31,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:31,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:44:31,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:31,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:31,466 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 02:44:31,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:31,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 02:44:31,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:31,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 02:44:31,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 02:44:31,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-02 02:44:31,467 INFO L87 Difference]: Start difference. First operand 34551 states and 139552 transitions. Second operand 18 states. [2018-12-02 02:44:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:32,633 INFO L93 Difference]: Finished difference Result 41153 states and 164986 transitions. [2018-12-02 02:44:32,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 02:44:32,634 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-12-02 02:44:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:32,704 INFO L225 Difference]: With dead ends: 41153 [2018-12-02 02:44:32,705 INFO L226 Difference]: Without dead ends: 40688 [2018-12-02 02:44:32,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 02:44:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40688 states. [2018-12-02 02:44:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40688 to 32997. [2018-12-02 02:44:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32997 states. [2018-12-02 02:44:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32997 states to 32997 states and 133345 transitions. [2018-12-02 02:44:33,228 INFO L78 Accepts]: Start accepts. Automaton has 32997 states and 133345 transitions. Word has length 55 [2018-12-02 02:44:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:33,228 INFO L480 AbstractCegarLoop]: Abstraction has 32997 states and 133345 transitions. [2018-12-02 02:44:33,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 02:44:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 32997 states and 133345 transitions. [2018-12-02 02:44:33,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:44:33,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:33,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, 1, 1, 1, 1, 1, 1, 1, 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 02:44:33,253 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:33,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:33,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2007864715, now seen corresponding path program 1 times [2018-12-02 02:44:33,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:33,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:33,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:33,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:33,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:33,758 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 02:44:33,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:33,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 02:44:33,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:33,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 02:44:33,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 02:44:33,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-02 02:44:33,759 INFO L87 Difference]: Start difference. First operand 32997 states and 133345 transitions. Second operand 18 states. [2018-12-02 02:44:34,319 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2018-12-02 02:44:34,544 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2018-12-02 02:44:34,676 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-12-02 02:44:34,822 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2018-12-02 02:44:34,946 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-12-02 02:44:35,094 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2018-12-02 02:44:35,234 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2018-12-02 02:44:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:35,533 INFO L93 Difference]: Finished difference Result 32175 states and 127243 transitions. [2018-12-02 02:44:35,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 02:44:35,533 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-12-02 02:44:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:35,587 INFO L225 Difference]: With dead ends: 32175 [2018-12-02 02:44:35,587 INFO L226 Difference]: Without dead ends: 31245 [2018-12-02 02:44:35,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2018-12-02 02:44:35,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31245 states. [2018-12-02 02:44:35,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31245 to 24269. [2018-12-02 02:44:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24269 states. [2018-12-02 02:44:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24269 states to 24269 states and 95867 transitions. [2018-12-02 02:44:35,976 INFO L78 Accepts]: Start accepts. Automaton has 24269 states and 95867 transitions. Word has length 55 [2018-12-02 02:44:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:35,977 INFO L480 AbstractCegarLoop]: Abstraction has 24269 states and 95867 transitions. [2018-12-02 02:44:35,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 02:44:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 24269 states and 95867 transitions. [2018-12-02 02:44:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:44:35,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:35,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:35,996 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:35,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:35,996 INFO L82 PathProgramCache]: Analyzing trace with hash -406541239, now seen corresponding path program 1 times [2018-12-02 02:44:35,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:35,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:35,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:35,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:35,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:36,332 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 02:44:36,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:36,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 02:44:36,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:36,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:44:36,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:44:36,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:44:36,333 INFO L87 Difference]: Start difference. First operand 24269 states and 95867 transitions. Second operand 19 states. [2018-12-02 02:44:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:37,093 INFO L93 Difference]: Finished difference Result 27222 states and 106645 transitions. [2018-12-02 02:44:37,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 02:44:37,093 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-02 02:44:37,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:37,138 INFO L225 Difference]: With dead ends: 27222 [2018-12-02 02:44:37,138 INFO L226 Difference]: Without dead ends: 26325 [2018-12-02 02:44:37,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-12-02 02:44:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26325 states. [2018-12-02 02:44:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26325 to 25025. [2018-12-02 02:44:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25025 states. [2018-12-02 02:44:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25025 states to 25025 states and 98727 transitions. [2018-12-02 02:44:37,513 INFO L78 Accepts]: Start accepts. Automaton has 25025 states and 98727 transitions. Word has length 55 [2018-12-02 02:44:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:37,513 INFO L480 AbstractCegarLoop]: Abstraction has 25025 states and 98727 transitions. [2018-12-02 02:44:37,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:44:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 25025 states and 98727 transitions. [2018-12-02 02:44:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:44:37,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:37,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:37,534 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:37,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:37,535 INFO L82 PathProgramCache]: Analyzing trace with hash -513722103, now seen corresponding path program 2 times [2018-12-02 02:44:37,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:37,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:37,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:37,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:37,770 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 02:44:37,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:37,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 02:44:37,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:37,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 02:44:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 02:44:37,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-02 02:44:37,771 INFO L87 Difference]: Start difference. First operand 25025 states and 98727 transitions. Second operand 16 states. [2018-12-02 02:44:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:38,173 INFO L93 Difference]: Finished difference Result 30553 states and 119704 transitions. [2018-12-02 02:44:38,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 02:44:38,173 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-12-02 02:44:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:38,225 INFO L225 Difference]: With dead ends: 30553 [2018-12-02 02:44:38,225 INFO L226 Difference]: Without dead ends: 29656 [2018-12-02 02:44:38,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2018-12-02 02:44:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29656 states. [2018-12-02 02:44:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29656 to 25173. [2018-12-02 02:44:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25173 states. [2018-12-02 02:44:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25173 states to 25173 states and 99424 transitions. [2018-12-02 02:44:38,616 INFO L78 Accepts]: Start accepts. Automaton has 25173 states and 99424 transitions. Word has length 55 [2018-12-02 02:44:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:38,617 INFO L480 AbstractCegarLoop]: Abstraction has 25173 states and 99424 transitions. [2018-12-02 02:44:38,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 02:44:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 25173 states and 99424 transitions. [2018-12-02 02:44:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:44:38,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:38,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:38,637 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:38,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1109025908, now seen corresponding path program 2 times [2018-12-02 02:44:38,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:38,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:44:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:38,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:38,702 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 02:44:38,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:38,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 02:44:38,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:38,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 02:44:38,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:44:38,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:44:38,703 INFO L87 Difference]: Start difference. First operand 25173 states and 99424 transitions. Second operand 10 states. [2018-12-02 02:44:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:39,001 INFO L93 Difference]: Finished difference Result 28345 states and 110953 transitions. [2018-12-02 02:44:39,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 02:44:39,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-02 02:44:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:39,051 INFO L225 Difference]: With dead ends: 28345 [2018-12-02 02:44:39,051 INFO L226 Difference]: Without dead ends: 27421 [2018-12-02 02:44:39,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:44:39,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27421 states. [2018-12-02 02:44:39,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27421 to 23789. [2018-12-02 02:44:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23789 states. [2018-12-02 02:44:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23789 states to 23789 states and 94227 transitions. [2018-12-02 02:44:39,405 INFO L78 Accepts]: Start accepts. Automaton has 23789 states and 94227 transitions. Word has length 55 [2018-12-02 02:44:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:39,405 INFO L480 AbstractCegarLoop]: Abstraction has 23789 states and 94227 transitions. [2018-12-02 02:44:39,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 02:44:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 23789 states and 94227 transitions. [2018-12-02 02:44:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 02:44:39,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:39,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:39,424 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:39,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:39,424 INFO L82 PathProgramCache]: Analyzing trace with hash 506208263, now seen corresponding path program 1 times [2018-12-02 02:44:39,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:39,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:39,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:44:39,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:39,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:39,956 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 02:44:39,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:39,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-02 02:44:39,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:39,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 02:44:39,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 02:44:39,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-12-02 02:44:39,957 INFO L87 Difference]: Start difference. First operand 23789 states and 94227 transitions. Second operand 20 states. [2018-12-02 02:44:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:40,651 INFO L93 Difference]: Finished difference Result 21753 states and 85053 transitions. [2018-12-02 02:44:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 02:44:40,652 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2018-12-02 02:44:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:40,684 INFO L225 Difference]: With dead ends: 21753 [2018-12-02 02:44:40,684 INFO L226 Difference]: Without dead ends: 20493 [2018-12-02 02:44:40,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-12-02 02:44:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20493 states. [2018-12-02 02:44:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20493 to 17871. [2018-12-02 02:44:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17871 states. [2018-12-02 02:44:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17871 states to 17871 states and 69982 transitions. [2018-12-02 02:44:40,944 INFO L78 Accepts]: Start accepts. Automaton has 17871 states and 69982 transitions. Word has length 57 [2018-12-02 02:44:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:40,944 INFO L480 AbstractCegarLoop]: Abstraction has 17871 states and 69982 transitions. [2018-12-02 02:44:40,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 02:44:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 17871 states and 69982 transitions. [2018-12-02 02:44:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 02:44:40,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:40,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:40,959 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:40,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:40,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1231209688, now seen corresponding path program 1 times [2018-12-02 02:44:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:40,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:40,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:41,423 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 02:44:41,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:41,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 02:44:41,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:41,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:44:41,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:44:41,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:44:41,424 INFO L87 Difference]: Start difference. First operand 17871 states and 69982 transitions. Second operand 19 states. [2018-12-02 02:44:42,074 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2018-12-02 02:44:42,375 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2018-12-02 02:44:42,839 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2018-12-02 02:44:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:43,135 INFO L93 Difference]: Finished difference Result 25528 states and 98380 transitions. [2018-12-02 02:44:43,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 02:44:43,136 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-12-02 02:44:43,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:43,171 INFO L225 Difference]: With dead ends: 25528 [2018-12-02 02:44:43,172 INFO L226 Difference]: Without dead ends: 22783 [2018-12-02 02:44:43,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 02:44:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22783 states. [2018-12-02 02:44:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22783 to 13889. [2018-12-02 02:44:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13889 states. [2018-12-02 02:44:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13889 states to 13889 states and 53786 transitions. [2018-12-02 02:44:43,414 INFO L78 Accepts]: Start accepts. Automaton has 13889 states and 53786 transitions. Word has length 57 [2018-12-02 02:44:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:43,414 INFO L480 AbstractCegarLoop]: Abstraction has 13889 states and 53786 transitions. [2018-12-02 02:44:43,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:44:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 13889 states and 53786 transitions. [2018-12-02 02:44:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 02:44:43,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:43,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:43,427 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:43,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1637424555, now seen corresponding path program 1 times [2018-12-02 02:44:43,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:43,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:43,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:43,801 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 02:44:43,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:43,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 02:44:43,801 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:43,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:44:43,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:44:43,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:44:43,802 INFO L87 Difference]: Start difference. First operand 13889 states and 53786 transitions. Second operand 19 states. [2018-12-02 02:44:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:44,436 INFO L93 Difference]: Finished difference Result 18233 states and 70178 transitions. [2018-12-02 02:44:44,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 02:44:44,436 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-12-02 02:44:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:44,457 INFO L225 Difference]: With dead ends: 18233 [2018-12-02 02:44:44,457 INFO L226 Difference]: Without dead ends: 14273 [2018-12-02 02:44:44,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-12-02 02:44:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2018-12-02 02:44:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 11633. [2018-12-02 02:44:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2018-12-02 02:44:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 43674 transitions. [2018-12-02 02:44:44,616 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 43674 transitions. Word has length 58 [2018-12-02 02:44:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:44,616 INFO L480 AbstractCegarLoop]: Abstraction has 11633 states and 43674 transitions. [2018-12-02 02:44:44,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:44:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 43674 transitions. [2018-12-02 02:44:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 02:44:44,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:44,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:44,626 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:44,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:44,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1019541803, now seen corresponding path program 2 times [2018-12-02 02:44:44,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:44,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:44,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:44,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:44,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:45,192 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 02:44:45,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:45,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 02:44:45,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:45,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 02:44:45,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 02:44:45,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-02 02:44:45,193 INFO L87 Difference]: Start difference. First operand 11633 states and 43674 transitions. Second operand 16 states. [2018-12-02 02:44:45,889 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-12-02 02:44:46,023 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-12-02 02:44:46,677 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-12-02 02:44:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:46,825 INFO L93 Difference]: Finished difference Result 10553 states and 38610 transitions. [2018-12-02 02:44:46,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 02:44:46,826 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-12-02 02:44:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:46,837 INFO L225 Difference]: With dead ends: 10553 [2018-12-02 02:44:46,837 INFO L226 Difference]: Without dead ends: 9063 [2018-12-02 02:44:46,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 02:44:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9063 states. [2018-12-02 02:44:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9063 to 9063. [2018-12-02 02:44:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2018-12-02 02:44:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 33711 transitions. [2018-12-02 02:44:46,949 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 33711 transitions. Word has length 58 [2018-12-02 02:44:46,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:46,950 INFO L480 AbstractCegarLoop]: Abstraction has 9063 states and 33711 transitions. [2018-12-02 02:44:46,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 02:44:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 33711 transitions. [2018-12-02 02:44:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 02:44:46,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:46,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:46,957 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:46,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:46,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1171302596, now seen corresponding path program 1 times [2018-12-02 02:44:46,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:46,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:46,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:44:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:46,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:47,509 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 02:44:47,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:47,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 02:44:47,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:47,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 02:44:47,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 02:44:47,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-12-02 02:44:47,510 INFO L87 Difference]: Start difference. First operand 9063 states and 33711 transitions. Second operand 21 states. [2018-12-02 02:44:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:48,653 INFO L93 Difference]: Finished difference Result 10116 states and 37492 transitions. [2018-12-02 02:44:48,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 02:44:48,654 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-12-02 02:44:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:48,665 INFO L225 Difference]: With dead ends: 10116 [2018-12-02 02:44:48,665 INFO L226 Difference]: Without dead ends: 8685 [2018-12-02 02:44:48,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2018-12-02 02:44:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8685 states. [2018-12-02 02:44:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8685 to 8109. [2018-12-02 02:44:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8109 states. [2018-12-02 02:44:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 29535 transitions. [2018-12-02 02:44:48,760 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 29535 transitions. Word has length 60 [2018-12-02 02:44:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:48,760 INFO L480 AbstractCegarLoop]: Abstraction has 8109 states and 29535 transitions. [2018-12-02 02:44:48,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 02:44:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 29535 transitions. [2018-12-02 02:44:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 02:44:48,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:48,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:48,767 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:48,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:48,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1909123070, now seen corresponding path program 2 times [2018-12-02 02:44:48,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:48,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:48,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:48,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:44:49,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:49,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-02 02:44:49,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:49,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 02:44:49,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 02:44:49,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-12-02 02:44:49,323 INFO L87 Difference]: Start difference. First operand 8109 states and 29535 transitions. Second operand 20 states. [2018-12-02 02:44:49,971 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2018-12-02 02:44:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:50,538 INFO L93 Difference]: Finished difference Result 9270 states and 33722 transitions. [2018-12-02 02:44:50,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 02:44:50,538 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-02 02:44:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:50,558 INFO L225 Difference]: With dead ends: 9270 [2018-12-02 02:44:50,558 INFO L226 Difference]: Without dead ends: 8793 [2018-12-02 02:44:50,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-12-02 02:44:50,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8793 states. [2018-12-02 02:44:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8793 to 7893. [2018-12-02 02:44:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2018-12-02 02:44:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 28711 transitions. [2018-12-02 02:44:50,656 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 28711 transitions. Word has length 60 [2018-12-02 02:44:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:50,657 INFO L480 AbstractCegarLoop]: Abstraction has 7893 states and 28711 transitions. [2018-12-02 02:44:50,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 02:44:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 28711 transitions. [2018-12-02 02:44:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 02:44:50,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:50,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:50,663 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:50,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:50,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2058615640, now seen corresponding path program 1 times [2018-12-02 02:44:50,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:50,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:50,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:44:50,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:50,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:51,152 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 02:44:51,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:51,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-02 02:44:51,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:51,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 02:44:51,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 02:44:51,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-02 02:44:51,153 INFO L87 Difference]: Start difference. First operand 7893 states and 28711 transitions. Second operand 20 states. [2018-12-02 02:44:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:51,455 INFO L93 Difference]: Finished difference Result 8949 states and 32183 transitions. [2018-12-02 02:44:51,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 02:44:51,456 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-02 02:44:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:51,466 INFO L225 Difference]: With dead ends: 8949 [2018-12-02 02:44:51,466 INFO L226 Difference]: Without dead ends: 7509 [2018-12-02 02:44:51,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-12-02 02:44:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7509 states. [2018-12-02 02:44:51,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7509 to 7509. [2018-12-02 02:44:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7509 states. [2018-12-02 02:44:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7509 states to 7509 states and 27191 transitions. [2018-12-02 02:44:51,551 INFO L78 Accepts]: Start accepts. Automaton has 7509 states and 27191 transitions. Word has length 60 [2018-12-02 02:44:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:51,551 INFO L480 AbstractCegarLoop]: Abstraction has 7509 states and 27191 transitions. [2018-12-02 02:44:51,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 02:44:51,551 INFO L276 IsEmpty]: Start isEmpty. Operand 7509 states and 27191 transitions. [2018-12-02 02:44:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 02:44:51,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:51,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:51,557 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:51,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:51,557 INFO L82 PathProgramCache]: Analyzing trace with hash -726446296, now seen corresponding path program 2 times [2018-12-02 02:44:51,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:51,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:51,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:51,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:51,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:52,026 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 02:44:52,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:52,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-02 02:44:52,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:52,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 02:44:52,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 02:44:52,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-02 02:44:52,027 INFO L87 Difference]: Start difference. First operand 7509 states and 27191 transitions. Second operand 20 states. [2018-12-02 02:44:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:52,304 INFO L93 Difference]: Finished difference Result 4917 states and 17063 transitions. [2018-12-02 02:44:52,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 02:44:52,304 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-02 02:44:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:52,308 INFO L225 Difference]: With dead ends: 4917 [2018-12-02 02:44:52,309 INFO L226 Difference]: Without dead ends: 3597 [2018-12-02 02:44:52,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-12-02 02:44:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2018-12-02 02:44:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3597. [2018-12-02 02:44:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-12-02 02:44:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 12663 transitions. [2018-12-02 02:44:52,341 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 12663 transitions. Word has length 60 [2018-12-02 02:44:52,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:52,341 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 12663 transitions. [2018-12-02 02:44:52,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 02:44:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 12663 transitions. [2018-12-02 02:44:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 02:44:52,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:52,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:52,343 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:52,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:52,343 INFO L82 PathProgramCache]: Analyzing trace with hash -894531326, now seen corresponding path program 3 times [2018-12-02 02:44:52,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:52,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:52,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:44:52,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:52,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:44:53,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:53,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 02:44:53,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:53,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:44:53,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:44:53,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:44:53,088 INFO L87 Difference]: Start difference. First operand 3597 states and 12663 transitions. Second operand 19 states. [2018-12-02 02:44:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:53,432 INFO L93 Difference]: Finished difference Result 4296 states and 14936 transitions. [2018-12-02 02:44:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 02:44:53,432 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-12-02 02:44:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:53,437 INFO L225 Difference]: With dead ends: 4296 [2018-12-02 02:44:53,437 INFO L226 Difference]: Without dead ends: 3549 [2018-12-02 02:44:53,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-12-02 02:44:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2018-12-02 02:44:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3549. [2018-12-02 02:44:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-12-02 02:44:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 12499 transitions. [2018-12-02 02:44:53,470 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 12499 transitions. Word has length 60 [2018-12-02 02:44:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:53,470 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 12499 transitions. [2018-12-02 02:44:53,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:44:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 12499 transitions. [2018-12-02 02:44:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 02:44:53,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:53,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:44:53,473 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:53,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:53,473 INFO L82 PathProgramCache]: Analyzing trace with hash 314196332, now seen corresponding path program 4 times [2018-12-02 02:44:53,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:44:53,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:53,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:44:53,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:53,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:44:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:53,917 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 02:44:53,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:53,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 02:44:53,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:44:53,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:44:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:44:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:44:53,918 INFO L87 Difference]: Start difference. First operand 3549 states and 12499 transitions. Second operand 19 states. [2018-12-02 02:44:54,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:54,149 INFO L93 Difference]: Finished difference Result 882 states and 2688 transitions. [2018-12-02 02:44:54,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 02:44:54,149 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-12-02 02:44:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:54,150 INFO L225 Difference]: With dead ends: 882 [2018-12-02 02:44:54,150 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 02:44:54,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-12-02 02:44:54,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 02:44:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 02:44:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 02:44:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 02:44:54,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-12-02 02:44:54,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:54,150 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:44:54,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:44:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:44:54,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 02:44:54,153 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 02:44:54,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:44:54 BasicIcfg [2018-12-02 02:44:54,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:44:54,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:44:54,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:44:54,154 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:44:54,154 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:43:54" (3/4) ... [2018-12-02 02:44:54,157 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 02:44:54,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread0 [2018-12-02 02:44:54,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2018-12-02 02:44:54,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2018-12-02 02:44:54,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2018-12-02 02:44:54,163 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 02:44:54,163 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 02:44:54,186 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fa34d999-ade8-499e-b6a4-a978db98840a/bin-2019/utaipan/witness.graphml [2018-12-02 02:44:54,186 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:44:54,186 INFO L168 Benchmark]: Toolchain (without parser) took 60904.75 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 956.0 MB in the beginning and 1.7 GB in the end (delta: -763.4 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-02 02:44:54,187 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:44:54,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-02 02:44:54,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:44:54,187 INFO L168 Benchmark]: Boogie Preprocessor took 15.91 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-02 02:44:54,187 INFO L168 Benchmark]: RCFGBuilder took 237.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:44:54,188 INFO L168 Benchmark]: TraceAbstraction took 60141.55 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -671.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-02 02:44:54,188 INFO L168 Benchmark]: Witness Printer took 32.06 ms. Allocated memory is still 4.6 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:44:54,189 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 444.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.91 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 237.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60141.55 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -671.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 32.06 ms. Allocated memory is still 4.6 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1212]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 172 locations, 1 error locations. SAFE Result, 59.9s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 29.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6310 SDtfs, 18064 SDslu, 36552 SDs, 0 SdLazy, 14965 SolverSat, 2451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 98 SyntacticMatches, 44 SemanticMatches, 756 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 21.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60962occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 15.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 177045 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1733 NumberOfCodeBlocks, 1733 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1700 ConstructedInterpolants, 0 QuantifiedInterpolants, 1541418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...