./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_db7cf3f2-be83-41c9-aa34-1bb4adc37039/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/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_db7cf3f2-be83-41c9-aa34-1bb4adc37039/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/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-09 19:25:04,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:25:04,570 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:25:04,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:25:04,576 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:25:04,576 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:25:04,577 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:25:04,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:25:04,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:25:04,579 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:25:04,579 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:25:04,579 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:25:04,580 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:25:04,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:25:04,581 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:25:04,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:25:04,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:25:04,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:25:04,583 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:25:04,584 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:25:04,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:25:04,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:25:04,586 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:25:04,586 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:25:04,586 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:25:04,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:25:04,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:25:04,587 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:25:04,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:25:04,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:25:04,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:25:04,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:25:04,588 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:25:04,588 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:25:04,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:25:04,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:25:04,589 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:25:04,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:25:04,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:25:04,597 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:25:04,597 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:25:04,597 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:25:04,597 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:25:04,597 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:25:04,597 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:25:04,597 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:25:04,597 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:25:04,597 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:25:04,597 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:25:04,597 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:25:04,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:25:04,598 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:25:04,598 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:25:04,598 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:25:04,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:25:04,598 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:25:04,598 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:25:04,598 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:25:04,598 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:25:04,598 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:25:04,598 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:25:04,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:25:04,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:25:04,599 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:25:04,599 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:25:04,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:25:04,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:25:04,599 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:25:04,599 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:25:04,599 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:25:04,599 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:25:04,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:25:04,599 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:25:04,599 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_db7cf3f2-be83-41c9-aa34-1bb4adc37039/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-09 19:25:04,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:25:04,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:25:04,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:25:04,629 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:25:04,629 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:25:04,629 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/bin-2019/utaipan/../../sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2018-12-09 19:25:04,675 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/bin-2019/utaipan/data/0d87b8ee0/238995ea3c0d42ff86c718a57db445a3/FLAG87b7296a6 [2018-12-09 19:25:05,019 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:25:05,019 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2018-12-09 19:25:05,028 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/bin-2019/utaipan/data/0d87b8ee0/238995ea3c0d42ff86c718a57db445a3/FLAG87b7296a6 [2018-12-09 19:25:05,036 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/bin-2019/utaipan/data/0d87b8ee0/238995ea3c0d42ff86c718a57db445a3 [2018-12-09 19:25:05,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:25:05,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:25:05,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:25:05,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:25:05,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:25:05,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:25:05" (1/1) ... [2018-12-09 19:25:05,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f76134a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05, skipping insertion in model container [2018-12-09 19:25:05,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:25:05" (1/1) ... [2018-12-09 19:25:05,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:25:05,071 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:25:05,300 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:25:05,306 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:25:05,378 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:25:05,461 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:25:05,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05 WrapperNode [2018-12-09 19:25:05,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:25:05,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:25:05,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:25:05,462 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:25:05,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05" (1/1) ... [2018-12-09 19:25:05,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05" (1/1) ... [2018-12-09 19:25:05,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:25:05,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:25:05,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:25:05,490 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:25:05,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05" (1/1) ... [2018-12-09 19:25:05,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05" (1/1) ... [2018-12-09 19:25:05,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05" (1/1) ... [2018-12-09 19:25:05,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05" (1/1) ... [2018-12-09 19:25:05,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05" (1/1) ... [2018-12-09 19:25:05,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05" (1/1) ... [2018-12-09 19:25:05,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05" (1/1) ... [2018-12-09 19:25:05,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:25:05,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:25:05,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:25:05,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:25:05,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/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-09 19:25:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:25:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:25:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 19:25:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2018-12-09 19:25:05,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2018-12-09 19:25:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2018-12-09 19:25:05,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2018-12-09 19:25:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2018-12-09 19:25:05,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2018-12-09 19:25:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2018-12-09 19:25:05,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2018-12-09 19:25:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:25:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:25:05,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:25:05,540 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 19:25:05,714 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:25:05,714 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 19:25:05,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:05 BoogieIcfgContainer [2018-12-09 19:25:05,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:25:05,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:25:05,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:25:05,716 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:25:05,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:25:05" (1/3) ... [2018-12-09 19:25:05,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382a3edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:25:05, skipping insertion in model container [2018-12-09 19:25:05,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:05" (2/3) ... [2018-12-09 19:25:05,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382a3edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:25:05, skipping insertion in model container [2018-12-09 19:25:05,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:05" (3/3) ... [2018-12-09 19:25:05,718 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems_true-unreach-call.i [2018-12-09 19:25:05,743 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,744 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,744 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,744 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,744 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,744 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,745 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,745 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,745 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,745 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,745 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,745 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,746 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,746 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,746 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,746 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,746 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,746 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,747 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,747 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,747 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,747 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,747 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,748 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,748 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,748 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,748 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,748 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,749 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,749 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,749 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,749 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,749 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,749 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,750 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,750 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,750 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,750 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,750 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,750 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,750 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,751 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,751 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,751 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,751 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,751 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,751 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,751 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,754 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,754 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,754 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,754 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,754 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,755 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,755 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,755 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,755 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,755 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,755 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,756 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,756 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,756 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,756 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,756 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,756 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,757 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,757 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,758 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,758 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,758 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,758 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,758 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,758 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,759 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,759 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:25:05,860 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:25:05,860 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:25:05,865 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:25:05,877 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:25:05,893 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:25:05,893 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:25:05,893 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:25:05,893 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:25:05,893 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:25:05,893 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:25:05,893 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:25:05,893 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:25:05,901 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 239 transitions [2018-12-09 19:25:09,084 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 60962 states. [2018-12-09 19:25:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 60962 states. [2018-12-09 19:25:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 19:25:09,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:09,093 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-09 19:25:09,095 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:09,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1451762756, now seen corresponding path program 1 times [2018-12-09 19:25:09,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:09,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:09,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:09,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:09,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:09,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:09,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:09,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:09,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:09,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:09,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:09,273 INFO L87 Difference]: Start difference. First operand 60962 states. Second operand 5 states. [2018-12-09 19:25:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:09,769 INFO L93 Difference]: Finished difference Result 90537 states and 379072 transitions. [2018-12-09 19:25:09,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:09,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-09 19:25:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:09,946 INFO L225 Difference]: With dead ends: 90537 [2018-12-09 19:25:09,946 INFO L226 Difference]: Without dead ends: 40487 [2018-12-09 19:25:09,947 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-09 19:25:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40487 states. [2018-12-09 19:25:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40487 to 40487. [2018-12-09 19:25:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40487 states. [2018-12-09 19:25:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40487 states to 40487 states and 173218 transitions. [2018-12-09 19:25:10,869 INFO L78 Accepts]: Start accepts. Automaton has 40487 states and 173218 transitions. Word has length 33 [2018-12-09 19:25:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:10,870 INFO L480 AbstractCegarLoop]: Abstraction has 40487 states and 173218 transitions. [2018-12-09 19:25:10,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 40487 states and 173218 transitions. [2018-12-09 19:25:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:25:10,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:10,872 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-09 19:25:10,872 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:10,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:10,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1742157727, now seen corresponding path program 1 times [2018-12-09 19:25:10,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:10,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:10,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:10,992 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-09 19:25:10,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:10,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:25:10,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:10,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:25:10,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:25:10,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:25:10,994 INFO L87 Difference]: Start difference. First operand 40487 states and 173218 transitions. Second operand 10 states. [2018-12-09 19:25:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:11,545 INFO L93 Difference]: Finished difference Result 47144 states and 204499 transitions. [2018-12-09 19:25:11,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:25:11,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-09 19:25:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:11,688 INFO L225 Difference]: With dead ends: 47144 [2018-12-09 19:25:11,688 INFO L226 Difference]: Without dead ends: 47144 [2018-12-09 19:25:11,689 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-09 19:25:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47144 states. [2018-12-09 19:25:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47144 to 40505. [2018-12-09 19:25:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40505 states. [2018-12-09 19:25:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40505 states to 40505 states and 173247 transitions. [2018-12-09 19:25:12,651 INFO L78 Accepts]: Start accepts. Automaton has 40505 states and 173247 transitions. Word has length 35 [2018-12-09 19:25:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:12,651 INFO L480 AbstractCegarLoop]: Abstraction has 40505 states and 173247 transitions. [2018-12-09 19:25:12,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:25:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 40505 states and 173247 transitions. [2018-12-09 19:25:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:25:12,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:12,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:12,653 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:12,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:12,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1856245215, now seen corresponding path program 2 times [2018-12-09 19:25:12,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:12,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:12,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:12,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:12,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:12,736 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-09 19:25:12,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:12,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:25:12,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:12,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:25:12,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:25:12,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:25:12,737 INFO L87 Difference]: Start difference. First operand 40505 states and 173247 transitions. Second operand 10 states. [2018-12-09 19:25:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:13,233 INFO L93 Difference]: Finished difference Result 53745 states and 235686 transitions. [2018-12-09 19:25:13,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:25:13,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-09 19:25:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:13,395 INFO L225 Difference]: With dead ends: 53745 [2018-12-09 19:25:13,395 INFO L226 Difference]: Without dead ends: 53745 [2018-12-09 19:25:13,395 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-09 19:25:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53745 states. [2018-12-09 19:25:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53745 to 40451. [2018-12-09 19:25:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40451 states. [2018-12-09 19:25:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40451 states to 40451 states and 173155 transitions. [2018-12-09 19:25:14,291 INFO L78 Accepts]: Start accepts. Automaton has 40451 states and 173155 transitions. Word has length 35 [2018-12-09 19:25:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:14,291 INFO L480 AbstractCegarLoop]: Abstraction has 40451 states and 173155 transitions. [2018-12-09 19:25:14,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:25:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 40451 states and 173155 transitions. [2018-12-09 19:25:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 19:25:14,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:14,301 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-09 19:25:14,301 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:14,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:14,302 INFO L82 PathProgramCache]: Analyzing trace with hash 864239609, now seen corresponding path program 1 times [2018-12-09 19:25:14,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:14,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:14,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:14,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:14,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:14,350 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-09 19:25:14,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:14,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:14,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:14,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:14,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:14,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:14,351 INFO L87 Difference]: Start difference. First operand 40451 states and 173155 transitions. Second operand 5 states. [2018-12-09 19:25:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:14,708 INFO L93 Difference]: Finished difference Result 74947 states and 314581 transitions. [2018-12-09 19:25:14,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:25:14,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-09 19:25:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:14,831 INFO L225 Difference]: With dead ends: 74947 [2018-12-09 19:25:14,831 INFO L226 Difference]: Without dead ends: 56513 [2018-12-09 19:25:14,831 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-09 19:25:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56513 states. [2018-12-09 19:25:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56513 to 40763. [2018-12-09 19:25:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40763 states. [2018-12-09 19:25:15,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40763 states to 40763 states and 169305 transitions. [2018-12-09 19:25:15,813 INFO L78 Accepts]: Start accepts. Automaton has 40763 states and 169305 transitions. Word has length 45 [2018-12-09 19:25:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:15,813 INFO L480 AbstractCegarLoop]: Abstraction has 40763 states and 169305 transitions. [2018-12-09 19:25:15,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 40763 states and 169305 transitions. [2018-12-09 19:25:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:25:15,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:15,827 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-09 19:25:15,827 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:15,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash 967863130, now seen corresponding path program 1 times [2018-12-09 19:25:15,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:15,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:15,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:15,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:15,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:16,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-09 19:25:16,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:16,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 19:25:16,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:16,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:25:16,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:25:16,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:25:16,194 INFO L87 Difference]: Start difference. First operand 40763 states and 169305 transitions. Second operand 19 states. [2018-12-09 19:25:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:18,244 INFO L93 Difference]: Finished difference Result 58950 states and 239857 transitions. [2018-12-09 19:25:18,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 19:25:18,244 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-12-09 19:25:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:18,356 INFO L225 Difference]: With dead ends: 58950 [2018-12-09 19:25:18,356 INFO L226 Difference]: Without dead ends: 56542 [2018-12-09 19:25:18,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 19:25:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56542 states. [2018-12-09 19:25:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56542 to 40733. [2018-12-09 19:25:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40733 states. [2018-12-09 19:25:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40733 states to 40733 states and 169201 transitions. [2018-12-09 19:25:20,019 INFO L78 Accepts]: Start accepts. Automaton has 40733 states and 169201 transitions. Word has length 47 [2018-12-09 19:25:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:20,019 INFO L480 AbstractCegarLoop]: Abstraction has 40733 states and 169201 transitions. [2018-12-09 19:25:20,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:25:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 40733 states and 169201 transitions. [2018-12-09 19:25:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:25:20,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:20,032 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-09 19:25:20,032 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:20,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:20,032 INFO L82 PathProgramCache]: Analyzing trace with hash 565489518, now seen corresponding path program 2 times [2018-12-09 19:25:20,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:20,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:20,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:20,097 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-09 19:25:20,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:20,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:25:20,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:20,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:25:20,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:25:20,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:25:20,098 INFO L87 Difference]: Start difference. First operand 40733 states and 169201 transitions. Second operand 9 states. [2018-12-09 19:25:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:20,481 INFO L93 Difference]: Finished difference Result 58841 states and 239535 transitions. [2018-12-09 19:25:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:20,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-12-09 19:25:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:20,594 INFO L225 Difference]: With dead ends: 58841 [2018-12-09 19:25:20,594 INFO L226 Difference]: Without dead ends: 56433 [2018-12-09 19:25:20,594 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-09 19:25:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56433 states. [2018-12-09 19:25:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56433 to 40658. [2018-12-09 19:25:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40658 states. [2018-12-09 19:25:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40658 states to 40658 states and 168991 transitions. [2018-12-09 19:25:21,342 INFO L78 Accepts]: Start accepts. Automaton has 40658 states and 168991 transitions. Word has length 47 [2018-12-09 19:25:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:21,342 INFO L480 AbstractCegarLoop]: Abstraction has 40658 states and 168991 transitions. [2018-12-09 19:25:21,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:25:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 40658 states and 168991 transitions. [2018-12-09 19:25:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 19:25:21,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:21,359 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-09 19:25:21,359 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:21,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:21,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1318988660, now seen corresponding path program 1 times [2018-12-09 19:25:21,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:21,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:21,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:21,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:21,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:25:21,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:21,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:25:21,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:25:21,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:25:21,412 INFO L87 Difference]: Start difference. First operand 40658 states and 168991 transitions. Second operand 7 states. [2018-12-09 19:25:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:21,816 INFO L93 Difference]: Finished difference Result 71197 states and 287728 transitions. [2018-12-09 19:25:21,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:21,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-09 19:25:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:21,908 INFO L225 Difference]: With dead ends: 71197 [2018-12-09 19:25:21,908 INFO L226 Difference]: Without dead ends: 48359 [2018-12-09 19:25:21,908 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-09 19:25:22,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48359 states. [2018-12-09 19:25:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48359 to 42374. [2018-12-09 19:25:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42374 states. [2018-12-09 19:25:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42374 states to 42374 states and 171196 transitions. [2018-12-09 19:25:22,745 INFO L78 Accepts]: Start accepts. Automaton has 42374 states and 171196 transitions. Word has length 48 [2018-12-09 19:25:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:22,745 INFO L480 AbstractCegarLoop]: Abstraction has 42374 states and 171196 transitions. [2018-12-09 19:25:22,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:25:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 42374 states and 171196 transitions. [2018-12-09 19:25:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:25:22,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:22,769 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-09 19:25:22,769 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:22,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:22,769 INFO L82 PathProgramCache]: Analyzing trace with hash 183508982, now seen corresponding path program 1 times [2018-12-09 19:25:22,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:22,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:22,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:22,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:22,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:22,922 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-09 19:25:22,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:22,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:25:22,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:22,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:25:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:25:22,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:25:22,923 INFO L87 Difference]: Start difference. First operand 42374 states and 171196 transitions. Second operand 13 states. [2018-12-09 19:25:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:23,371 INFO L93 Difference]: Finished difference Result 54161 states and 215849 transitions. [2018-12-09 19:25:23,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:23,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-12-09 19:25:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:23,471 INFO L225 Difference]: With dead ends: 54161 [2018-12-09 19:25:23,472 INFO L226 Difference]: Without dead ends: 50905 [2018-12-09 19:25:23,472 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-09 19:25:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50905 states. [2018-12-09 19:25:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50905 to 42044. [2018-12-09 19:25:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42044 states. [2018-12-09 19:25:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42044 states to 42044 states and 169930 transitions. [2018-12-09 19:25:24,176 INFO L78 Accepts]: Start accepts. Automaton has 42044 states and 169930 transitions. Word has length 50 [2018-12-09 19:25:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:24,177 INFO L480 AbstractCegarLoop]: Abstraction has 42044 states and 169930 transitions. [2018-12-09 19:25:24,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:25:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 42044 states and 169930 transitions. [2018-12-09 19:25:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:25:24,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:24,201 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-09 19:25:24,201 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:24,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:24,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1136732819, now seen corresponding path program 1 times [2018-12-09 19:25:24,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:24,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:24,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:24,500 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-09 19:25:24,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:24,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 19:25:24,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:24,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 19:25:24,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 19:25:24,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:25:24,501 INFO L87 Difference]: Start difference. First operand 42044 states and 169930 transitions. Second operand 17 states. [2018-12-09 19:25:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:25,486 INFO L93 Difference]: Finished difference Result 48342 states and 195029 transitions. [2018-12-09 19:25:25,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:25:25,486 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-12-09 19:25:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:25,573 INFO L225 Difference]: With dead ends: 48342 [2018-12-09 19:25:25,573 INFO L226 Difference]: Without dead ends: 47886 [2018-12-09 19:25:25,573 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-09 19:25:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47886 states. [2018-12-09 19:25:26,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47886 to 45629. [2018-12-09 19:25:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45629 states. [2018-12-09 19:25:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45629 states to 45629 states and 185453 transitions. [2018-12-09 19:25:26,274 INFO L78 Accepts]: Start accepts. Automaton has 45629 states and 185453 transitions. Word has length 50 [2018-12-09 19:25:26,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:26,274 INFO L480 AbstractCegarLoop]: Abstraction has 45629 states and 185453 transitions. [2018-12-09 19:25:26,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 19:25:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 45629 states and 185453 transitions. [2018-12-09 19:25:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:25:26,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:26,301 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-09 19:25:26,301 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:26,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:26,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1695764147, now seen corresponding path program 2 times [2018-12-09 19:25:26,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:26,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:26,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:26,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:26,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:26,472 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-09 19:25:26,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:26,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:25:26,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:26,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:25:26,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:25:26,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:25:26,473 INFO L87 Difference]: Start difference. First operand 45629 states and 185453 transitions. Second operand 14 states. [2018-12-09 19:25:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:26,972 INFO L93 Difference]: Finished difference Result 56333 states and 228138 transitions. [2018-12-09 19:25:26,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:25:26,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-09 19:25:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:27,085 INFO L225 Difference]: With dead ends: 56333 [2018-12-09 19:25:27,085 INFO L226 Difference]: Without dead ends: 55877 [2018-12-09 19:25:27,085 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-09 19:25:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55877 states. [2018-12-09 19:25:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55877 to 45508. [2018-12-09 19:25:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45508 states. [2018-12-09 19:25:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45508 states to 45508 states and 185108 transitions. [2018-12-09 19:25:27,857 INFO L78 Accepts]: Start accepts. Automaton has 45508 states and 185108 transitions. Word has length 50 [2018-12-09 19:25:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:27,858 INFO L480 AbstractCegarLoop]: Abstraction has 45508 states and 185108 transitions. [2018-12-09 19:25:27,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:25:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 45508 states and 185108 transitions. [2018-12-09 19:25:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:25:27,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:27,884 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-09 19:25:27,884 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:27,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:27,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1546975859, now seen corresponding path program 1 times [2018-12-09 19:25:27,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:27,968 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-09 19:25:27,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:27,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:27,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:27,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:27,969 INFO L87 Difference]: Start difference. First operand 45508 states and 185108 transitions. Second operand 11 states. [2018-12-09 19:25:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:28,440 INFO L93 Difference]: Finished difference Result 56707 states and 227522 transitions. [2018-12-09 19:25:28,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:25:28,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-12-09 19:25:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:28,539 INFO L225 Difference]: With dead ends: 56707 [2018-12-09 19:25:28,539 INFO L226 Difference]: Without dead ends: 51132 [2018-12-09 19:25:28,540 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-09 19:25:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51132 states. [2018-12-09 19:25:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51132 to 44908. [2018-12-09 19:25:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44908 states. [2018-12-09 19:25:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44908 states to 44908 states and 182813 transitions. [2018-12-09 19:25:29,395 INFO L78 Accepts]: Start accepts. Automaton has 44908 states and 182813 transitions. Word has length 50 [2018-12-09 19:25:29,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:29,396 INFO L480 AbstractCegarLoop]: Abstraction has 44908 states and 182813 transitions. [2018-12-09 19:25:29,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 44908 states and 182813 transitions. [2018-12-09 19:25:29,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 19:25:29,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:29,429 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-09 19:25:29,430 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:29,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:29,430 INFO L82 PathProgramCache]: Analyzing trace with hash -295598450, now seen corresponding path program 1 times [2018-12-09 19:25:29,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:29,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:29,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:29,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:29,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:29,818 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-09 19:25:29,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:29,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 19:25:29,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:29,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 19:25:29,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 19:25:29,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:25:29,819 INFO L87 Difference]: Start difference. First operand 44908 states and 182813 transitions. Second operand 17 states. [2018-12-09 19:25:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:31,243 INFO L93 Difference]: Finished difference Result 55621 states and 226438 transitions. [2018-12-09 19:25:31,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:25:31,244 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-12-09 19:25:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:31,352 INFO L225 Difference]: With dead ends: 55621 [2018-12-09 19:25:31,352 INFO L226 Difference]: Without dead ends: 55165 [2018-12-09 19:25:31,353 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-09 19:25:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55165 states. [2018-12-09 19:25:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55165 to 44721. [2018-12-09 19:25:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44721 states. [2018-12-09 19:25:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44721 states to 44721 states and 182302 transitions. [2018-12-09 19:25:32,109 INFO L78 Accepts]: Start accepts. Automaton has 44721 states and 182302 transitions. Word has length 52 [2018-12-09 19:25:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:32,109 INFO L480 AbstractCegarLoop]: Abstraction has 44721 states and 182302 transitions. [2018-12-09 19:25:32,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 19:25:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 44721 states and 182302 transitions. [2018-12-09 19:25:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:25:32,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:32,144 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-09 19:25:32,144 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:32,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:32,145 INFO L82 PathProgramCache]: Analyzing trace with hash 809327577, now seen corresponding path program 1 times [2018-12-09 19:25:32,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:32,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:32,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:32,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:32,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:32,331 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-09 19:25:32,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:32,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 19:25:32,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:32,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 19:25:32,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 19:25:32,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:25:32,332 INFO L87 Difference]: Start difference. First operand 44721 states and 182302 transitions. Second operand 15 states. [2018-12-09 19:25:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:32,800 INFO L93 Difference]: Finished difference Result 52211 states and 210162 transitions. [2018-12-09 19:25:32,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:25:32,800 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-12-09 19:25:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:32,881 INFO L225 Difference]: With dead ends: 52211 [2018-12-09 19:25:32,881 INFO L226 Difference]: Without dead ends: 43294 [2018-12-09 19:25:32,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-09 19:25:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43294 states. [2018-12-09 19:25:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43294 to 37956. [2018-12-09 19:25:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37956 states. [2018-12-09 19:25:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37956 states to 37956 states and 153296 transitions. [2018-12-09 19:25:33,590 INFO L78 Accepts]: Start accepts. Automaton has 37956 states and 153296 transitions. Word has length 53 [2018-12-09 19:25:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:33,590 INFO L480 AbstractCegarLoop]: Abstraction has 37956 states and 153296 transitions. [2018-12-09 19:25:33,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 19:25:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 37956 states and 153296 transitions. [2018-12-09 19:25:33,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:25:33,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:33,617 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-09 19:25:33,618 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:33,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:33,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1410636712, now seen corresponding path program 1 times [2018-12-09 19:25:33,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:33,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:33,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:33,738 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-09 19:25:33,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:33,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:25:33,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:33,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:25:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:25:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:25:33,739 INFO L87 Difference]: Start difference. First operand 37956 states and 153296 transitions. Second operand 13 states. [2018-12-09 19:25:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:34,248 INFO L93 Difference]: Finished difference Result 46513 states and 186428 transitions. [2018-12-09 19:25:34,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:25:34,249 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-12-09 19:25:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:34,326 INFO L225 Difference]: With dead ends: 46513 [2018-12-09 19:25:34,326 INFO L226 Difference]: Without dead ends: 38243 [2018-12-09 19:25:34,326 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-09 19:25:34,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38243 states. [2018-12-09 19:25:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38243 to 32694. [2018-12-09 19:25:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32694 states. [2018-12-09 19:25:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 131852 transitions. [2018-12-09 19:25:34,875 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 131852 transitions. Word has length 53 [2018-12-09 19:25:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:34,875 INFO L480 AbstractCegarLoop]: Abstraction has 32694 states and 131852 transitions. [2018-12-09 19:25:34,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:25:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 131852 transitions. [2018-12-09 19:25:34,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:25:34,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:34,901 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-09 19:25:34,901 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:34,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:34,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1437077398, now seen corresponding path program 1 times [2018-12-09 19:25:34,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:34,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:34,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:34,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:34,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:35,461 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-09 19:25:35,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:35,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 19:25:35,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:35,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:25:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:25:35,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:25:35,462 INFO L87 Difference]: Start difference. First operand 32694 states and 131852 transitions. Second operand 19 states. [2018-12-09 19:25:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:36,762 INFO L93 Difference]: Finished difference Result 37734 states and 151509 transitions. [2018-12-09 19:25:36,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:25:36,762 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-09 19:25:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:36,830 INFO L225 Difference]: With dead ends: 37734 [2018-12-09 19:25:36,830 INFO L226 Difference]: Without dead ends: 37293 [2018-12-09 19:25:36,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2018-12-09 19:25:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37293 states. [2018-12-09 19:25:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37293 to 34905. [2018-12-09 19:25:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34905 states. [2018-12-09 19:25:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34905 states to 34905 states and 140988 transitions. [2018-12-09 19:25:37,381 INFO L78 Accepts]: Start accepts. Automaton has 34905 states and 140988 transitions. Word has length 55 [2018-12-09 19:25:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:37,381 INFO L480 AbstractCegarLoop]: Abstraction has 34905 states and 140988 transitions. [2018-12-09 19:25:37,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:25:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 34905 states and 140988 transitions. [2018-12-09 19:25:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:25:37,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:37,411 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-09 19:25:37,411 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:37,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:37,412 INFO L82 PathProgramCache]: Analyzing trace with hash -51175185, now seen corresponding path program 1 times [2018-12-09 19:25:37,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:37,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:37,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:37,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:37,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:37,789 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-09 19:25:37,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:37,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 19:25:37,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:37,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:25:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:25:37,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:25:37,790 INFO L87 Difference]: Start difference. First operand 34905 states and 140988 transitions. Second operand 19 states. [2018-12-09 19:25:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:38,774 INFO L93 Difference]: Finished difference Result 38941 states and 156506 transitions. [2018-12-09 19:25:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:25:38,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-09 19:25:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:38,844 INFO L225 Difference]: With dead ends: 38941 [2018-12-09 19:25:38,844 INFO L226 Difference]: Without dead ends: 38614 [2018-12-09 19:25:38,844 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-09 19:25:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38614 states. [2018-12-09 19:25:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38614 to 34635. [2018-12-09 19:25:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2018-12-09 19:25:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 139908 transitions. [2018-12-09 19:25:39,501 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 139908 transitions. Word has length 55 [2018-12-09 19:25:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:39,502 INFO L480 AbstractCegarLoop]: Abstraction has 34635 states and 139908 transitions. [2018-12-09 19:25:39,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:25:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 139908 transitions. [2018-12-09 19:25:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:25:39,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:39,530 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-09 19:25:39,530 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:39,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:39,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1740514353, now seen corresponding path program 2 times [2018-12-09 19:25:39,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:39,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:39,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:39,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:39,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:39,744 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-12-09 19:25:40,146 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-09 19:25:40,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:40,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 19:25:40,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:40,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:25:40,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:25:40,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:25:40,147 INFO L87 Difference]: Start difference. First operand 34635 states and 139908 transitions. Second operand 19 states. [2018-12-09 19:25:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:41,886 INFO L93 Difference]: Finished difference Result 39529 states and 158826 transitions. [2018-12-09 19:25:41,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 19:25:41,886 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-09 19:25:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:41,957 INFO L225 Difference]: With dead ends: 39529 [2018-12-09 19:25:41,957 INFO L226 Difference]: Without dead ends: 39082 [2018-12-09 19:25:41,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 19:25:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39082 states. [2018-12-09 19:25:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39082 to 34575. [2018-12-09 19:25:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34575 states. [2018-12-09 19:25:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34575 states to 34575 states and 139640 transitions. [2018-12-09 19:25:42,517 INFO L78 Accepts]: Start accepts. Automaton has 34575 states and 139640 transitions. Word has length 55 [2018-12-09 19:25:42,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:42,517 INFO L480 AbstractCegarLoop]: Abstraction has 34575 states and 139640 transitions. [2018-12-09 19:25:42,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:25:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 34575 states and 139640 transitions. [2018-12-09 19:25:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:25:42,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:42,547 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-09 19:25:42,547 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:42,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1094168167, now seen corresponding path program 3 times [2018-12-09 19:25:42,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:42,886 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-09 19:25:42,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:42,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 19:25:42,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:42,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 19:25:42,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 19:25:42,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:25:42,887 INFO L87 Difference]: Start difference. First operand 34575 states and 139640 transitions. Second operand 17 states. [2018-12-09 19:25:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:43,670 INFO L93 Difference]: Finished difference Result 39179 states and 157389 transitions. [2018-12-09 19:25:43,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 19:25:43,671 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-12-09 19:25:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:43,741 INFO L225 Difference]: With dead ends: 39179 [2018-12-09 19:25:43,741 INFO L226 Difference]: Without dead ends: 38714 [2018-12-09 19:25:43,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2018-12-09 19:25:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38714 states. [2018-12-09 19:25:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38714 to 34551. [2018-12-09 19:25:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34551 states. [2018-12-09 19:25:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34551 states to 34551 states and 139552 transitions. [2018-12-09 19:25:44,291 INFO L78 Accepts]: Start accepts. Automaton has 34551 states and 139552 transitions. Word has length 55 [2018-12-09 19:25:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:44,291 INFO L480 AbstractCegarLoop]: Abstraction has 34551 states and 139552 transitions. [2018-12-09 19:25:44,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 19:25:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 34551 states and 139552 transitions. [2018-12-09 19:25:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:25:44,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:44,320 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-09 19:25:44,320 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:44,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:44,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1874792967, now seen corresponding path program 4 times [2018-12-09 19:25:44,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:44,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:44,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:44,678 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-09 19:25:44,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:44,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 19:25:44,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:44,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 19:25:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 19:25:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:25:44,679 INFO L87 Difference]: Start difference. First operand 34551 states and 139552 transitions. Second operand 17 states. [2018-12-09 19:25:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:45,666 INFO L93 Difference]: Finished difference Result 41153 states and 164986 transitions. [2018-12-09 19:25:45,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 19:25:45,666 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-12-09 19:25:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:45,741 INFO L225 Difference]: With dead ends: 41153 [2018-12-09 19:25:45,741 INFO L226 Difference]: Without dead ends: 40688 [2018-12-09 19:25:45,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=872, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 19:25:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40688 states. [2018-12-09 19:25:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40688 to 32997. [2018-12-09 19:25:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32997 states. [2018-12-09 19:25:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32997 states to 32997 states and 133345 transitions. [2018-12-09 19:25:46,294 INFO L78 Accepts]: Start accepts. Automaton has 32997 states and 133345 transitions. Word has length 55 [2018-12-09 19:25:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:46,294 INFO L480 AbstractCegarLoop]: Abstraction has 32997 states and 133345 transitions. [2018-12-09 19:25:46,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 19:25:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 32997 states and 133345 transitions. [2018-12-09 19:25:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:25:46,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:46,321 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-09 19:25:46,321 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:46,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2007864715, now seen corresponding path program 1 times [2018-12-09 19:25:46,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:46,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:46,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:46,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:46,825 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-09 19:25:46,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:46,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-09 19:25:46,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:46,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 19:25:46,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 19:25:46,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-09 19:25:46,826 INFO L87 Difference]: Start difference. First operand 32997 states and 133345 transitions. Second operand 18 states. [2018-12-09 19:25:47,414 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2018-12-09 19:25:47,636 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2018-12-09 19:25:47,768 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-12-09 19:25:47,923 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2018-12-09 19:25:48,050 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-12-09 19:25:48,204 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2018-12-09 19:25:48,528 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2018-12-09 19:25:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:49,189 INFO L93 Difference]: Finished difference Result 32175 states and 127243 transitions. [2018-12-09 19:25:49,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:25:49,189 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-12-09 19:25:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:49,244 INFO L225 Difference]: With dead ends: 32175 [2018-12-09 19:25:49,244 INFO L226 Difference]: Without dead ends: 31245 [2018-12-09 19:25:49,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2018-12-09 19:25:49,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31245 states. [2018-12-09 19:25:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31245 to 24269. [2018-12-09 19:25:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24269 states. [2018-12-09 19:25:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24269 states to 24269 states and 95867 transitions. [2018-12-09 19:25:49,648 INFO L78 Accepts]: Start accepts. Automaton has 24269 states and 95867 transitions. Word has length 55 [2018-12-09 19:25:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:49,648 INFO L480 AbstractCegarLoop]: Abstraction has 24269 states and 95867 transitions. [2018-12-09 19:25:49,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 19:25:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 24269 states and 95867 transitions. [2018-12-09 19:25:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:25:49,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:49,668 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-09 19:25:49,668 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:49,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:49,668 INFO L82 PathProgramCache]: Analyzing trace with hash -406541239, now seen corresponding path program 1 times [2018-12-09 19:25:49,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:49,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:49,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:50,032 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-09 19:25:50,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:50,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 19:25:50,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:50,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:25:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:25:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:25:50,033 INFO L87 Difference]: Start difference. First operand 24269 states and 95867 transitions. Second operand 19 states. [2018-12-09 19:25:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:50,854 INFO L93 Difference]: Finished difference Result 27222 states and 106645 transitions. [2018-12-09 19:25:50,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:25:50,854 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-09 19:25:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:50,900 INFO L225 Difference]: With dead ends: 27222 [2018-12-09 19:25:50,900 INFO L226 Difference]: Without dead ends: 26325 [2018-12-09 19:25:50,900 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-09 19:25:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26325 states. [2018-12-09 19:25:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26325 to 25025. [2018-12-09 19:25:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25025 states. [2018-12-09 19:25:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25025 states to 25025 states and 98727 transitions. [2018-12-09 19:25:51,286 INFO L78 Accepts]: Start accepts. Automaton has 25025 states and 98727 transitions. Word has length 55 [2018-12-09 19:25:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:51,286 INFO L480 AbstractCegarLoop]: Abstraction has 25025 states and 98727 transitions. [2018-12-09 19:25:51,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:25:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 25025 states and 98727 transitions. [2018-12-09 19:25:51,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:25:51,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:51,307 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-09 19:25:51,307 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:51,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:51,307 INFO L82 PathProgramCache]: Analyzing trace with hash -513722103, now seen corresponding path program 2 times [2018-12-09 19:25:51,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:51,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:51,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:51,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:51,554 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-09 19:25:51,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:51,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-09 19:25:51,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:51,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 19:25:51,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 19:25:51,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:25:51,555 INFO L87 Difference]: Start difference. First operand 25025 states and 98727 transitions. Second operand 16 states. [2018-12-09 19:25:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:51,989 INFO L93 Difference]: Finished difference Result 30553 states and 119704 transitions. [2018-12-09 19:25:51,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:25:51,989 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-12-09 19:25:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:52,041 INFO L225 Difference]: With dead ends: 30553 [2018-12-09 19:25:52,041 INFO L226 Difference]: Without dead ends: 29656 [2018-12-09 19:25:52,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2018-12-09 19:25:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29656 states. [2018-12-09 19:25:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29656 to 25173. [2018-12-09 19:25:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25173 states. [2018-12-09 19:25:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25173 states to 25173 states and 99424 transitions. [2018-12-09 19:25:52,449 INFO L78 Accepts]: Start accepts. Automaton has 25173 states and 99424 transitions. Word has length 55 [2018-12-09 19:25:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:52,449 INFO L480 AbstractCegarLoop]: Abstraction has 25173 states and 99424 transitions. [2018-12-09 19:25:52,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 19:25:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 25173 states and 99424 transitions. [2018-12-09 19:25:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:25:52,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:52,470 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-09 19:25:52,471 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:52,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:52,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1096960816, now seen corresponding path program 2 times [2018-12-09 19:25:52,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:52,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:52,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:52,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:52,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:52,534 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-09 19:25:52,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:52,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:25:52,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:52,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:25:52,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:25:52,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:25:52,535 INFO L87 Difference]: Start difference. First operand 25173 states and 99424 transitions. Second operand 10 states. [2018-12-09 19:25:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:52,817 INFO L93 Difference]: Finished difference Result 28345 states and 110953 transitions. [2018-12-09 19:25:52,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:25:52,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-09 19:25:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:52,867 INFO L225 Difference]: With dead ends: 28345 [2018-12-09 19:25:52,867 INFO L226 Difference]: Without dead ends: 27421 [2018-12-09 19:25:52,868 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-09 19:25:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27421 states. [2018-12-09 19:25:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27421 to 23789. [2018-12-09 19:25:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23789 states. [2018-12-09 19:25:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23789 states to 23789 states and 94227 transitions. [2018-12-09 19:25:53,231 INFO L78 Accepts]: Start accepts. Automaton has 23789 states and 94227 transitions. Word has length 55 [2018-12-09 19:25:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:53,232 INFO L480 AbstractCegarLoop]: Abstraction has 23789 states and 94227 transitions. [2018-12-09 19:25:53,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:25:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 23789 states and 94227 transitions. [2018-12-09 19:25:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 19:25:53,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:53,251 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-09 19:25:53,252 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:53,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:53,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1617968395, now seen corresponding path program 1 times [2018-12-09 19:25:53,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:53,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:53,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:53,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:53,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:53,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:53,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 19:25:53,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:53,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 19:25:53,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 19:25:53,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-12-09 19:25:53,871 INFO L87 Difference]: Start difference. First operand 23789 states and 94227 transitions. Second operand 21 states. [2018-12-09 19:25:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:54,933 INFO L93 Difference]: Finished difference Result 21753 states and 85053 transitions. [2018-12-09 19:25:54,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:25:54,933 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-12-09 19:25:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:54,965 INFO L225 Difference]: With dead ends: 21753 [2018-12-09 19:25:54,966 INFO L226 Difference]: Without dead ends: 20493 [2018-12-09 19:25:54,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-12-09 19:25:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20493 states. [2018-12-09 19:25:55,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20493 to 17871. [2018-12-09 19:25:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17871 states. [2018-12-09 19:25:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17871 states to 17871 states and 69982 transitions. [2018-12-09 19:25:55,236 INFO L78 Accepts]: Start accepts. Automaton has 17871 states and 69982 transitions. Word has length 57 [2018-12-09 19:25:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:55,236 INFO L480 AbstractCegarLoop]: Abstraction has 17871 states and 69982 transitions. [2018-12-09 19:25:55,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 19:25:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 17871 states and 69982 transitions. [2018-12-09 19:25:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 19:25:55,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:55,252 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-09 19:25:55,252 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:55,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1231209688, now seen corresponding path program 1 times [2018-12-09 19:25:55,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:55,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:55,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:55,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:55,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:55,722 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-09 19:25:55,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:55,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 19:25:55,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:55,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:25:55,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:25:55,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:25:55,723 INFO L87 Difference]: Start difference. First operand 17871 states and 69982 transitions. Second operand 19 states. [2018-12-09 19:25:56,929 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2018-12-09 19:25:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:57,241 INFO L93 Difference]: Finished difference Result 25528 states and 98380 transitions. [2018-12-09 19:25:57,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:25:57,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-12-09 19:25:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:57,278 INFO L225 Difference]: With dead ends: 25528 [2018-12-09 19:25:57,279 INFO L226 Difference]: Without dead ends: 22783 [2018-12-09 19:25:57,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 19:25:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22783 states. [2018-12-09 19:25:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22783 to 13889. [2018-12-09 19:25:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13889 states. [2018-12-09 19:25:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13889 states to 13889 states and 53786 transitions. [2018-12-09 19:25:57,531 INFO L78 Accepts]: Start accepts. Automaton has 13889 states and 53786 transitions. Word has length 57 [2018-12-09 19:25:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:57,531 INFO L480 AbstractCegarLoop]: Abstraction has 13889 states and 53786 transitions. [2018-12-09 19:25:57,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:25:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 13889 states and 53786 transitions. [2018-12-09 19:25:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:25:57,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:57,545 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-09 19:25:57,545 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:57,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:57,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1637424555, now seen corresponding path program 1 times [2018-12-09 19:25:57,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:57,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:57,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:57,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:57,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:57,878 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-09 19:25:57,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:57,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 19:25:57,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:57,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:25:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:25:57,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:25:57,879 INFO L87 Difference]: Start difference. First operand 13889 states and 53786 transitions. Second operand 19 states. [2018-12-09 19:25:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:58,543 INFO L93 Difference]: Finished difference Result 18233 states and 70178 transitions. [2018-12-09 19:25:58,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:25:58,544 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-12-09 19:25:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:58,565 INFO L225 Difference]: With dead ends: 18233 [2018-12-09 19:25:58,565 INFO L226 Difference]: Without dead ends: 14273 [2018-12-09 19:25:58,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-12-09 19:25:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2018-12-09 19:25:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 11633. [2018-12-09 19:25:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2018-12-09 19:25:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 43674 transitions. [2018-12-09 19:25:58,732 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 43674 transitions. Word has length 58 [2018-12-09 19:25:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:58,732 INFO L480 AbstractCegarLoop]: Abstraction has 11633 states and 43674 transitions. [2018-12-09 19:25:58,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:25:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 43674 transitions. [2018-12-09 19:25:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:25:58,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:58,742 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-09 19:25:58,742 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:58,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:58,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1019541803, now seen corresponding path program 2 times [2018-12-09 19:25:58,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:58,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:58,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:58,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:58,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:59,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:59,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-09 19:25:59,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:59,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 19:25:59,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 19:25:59,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:25:59,291 INFO L87 Difference]: Start difference. First operand 11633 states and 43674 transitions. Second operand 16 states. [2018-12-09 19:25:59,918 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2018-12-09 19:26:00,471 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-12-09 19:26:01,013 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-12-09 19:26:01,286 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-12-09 19:26:01,410 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2018-12-09 19:26:01,975 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2018-12-09 19:26:02,249 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-12-09 19:26:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:02,376 INFO L93 Difference]: Finished difference Result 10553 states and 38610 transitions. [2018-12-09 19:26:02,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 19:26:02,376 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-12-09 19:26:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:02,388 INFO L225 Difference]: With dead ends: 10553 [2018-12-09 19:26:02,389 INFO L226 Difference]: Without dead ends: 9063 [2018-12-09 19:26:02,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 19:26:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9063 states. [2018-12-09 19:26:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9063 to 9063. [2018-12-09 19:26:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2018-12-09 19:26:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 33711 transitions. [2018-12-09 19:26:02,499 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 33711 transitions. Word has length 58 [2018-12-09 19:26:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:02,500 INFO L480 AbstractCegarLoop]: Abstraction has 9063 states and 33711 transitions. [2018-12-09 19:26:02,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 19:26:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 33711 transitions. [2018-12-09 19:26:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:26:02,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:02,508 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-09 19:26:02,508 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:02,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:02,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1171302596, now seen corresponding path program 1 times [2018-12-09 19:26:02,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:02,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:02,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:26:02,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:02,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:03,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:03,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 19:26:03,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:03,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 19:26:03,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 19:26:03,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-12-09 19:26:03,080 INFO L87 Difference]: Start difference. First operand 9063 states and 33711 transitions. Second operand 21 states. [2018-12-09 19:26:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:03,716 INFO L93 Difference]: Finished difference Result 10116 states and 37492 transitions. [2018-12-09 19:26:03,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:26:03,716 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-12-09 19:26:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:03,728 INFO L225 Difference]: With dead ends: 10116 [2018-12-09 19:26:03,728 INFO L226 Difference]: Without dead ends: 8685 [2018-12-09 19:26:03,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2018-12-09 19:26:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8685 states. [2018-12-09 19:26:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8685 to 8109. [2018-12-09 19:26:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8109 states. [2018-12-09 19:26:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 29535 transitions. [2018-12-09 19:26:03,828 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 29535 transitions. Word has length 60 [2018-12-09 19:26:03,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:03,828 INFO L480 AbstractCegarLoop]: Abstraction has 8109 states and 29535 transitions. [2018-12-09 19:26:03,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 19:26:03,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 29535 transitions. [2018-12-09 19:26:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:26:03,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:03,836 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-09 19:26:03,836 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:03,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:03,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1909123070, now seen corresponding path program 2 times [2018-12-09 19:26:03,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:03,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:03,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:03,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:03,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:04,381 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-09 19:26:04,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:04,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-09 19:26:04,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:04,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 19:26:04,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 19:26:04,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:26:04,381 INFO L87 Difference]: Start difference. First operand 8109 states and 29535 transitions. Second operand 20 states. [2018-12-09 19:26:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:05,155 INFO L93 Difference]: Finished difference Result 9270 states and 33722 transitions. [2018-12-09 19:26:05,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:26:05,156 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-09 19:26:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:05,167 INFO L225 Difference]: With dead ends: 9270 [2018-12-09 19:26:05,167 INFO L226 Difference]: Without dead ends: 8793 [2018-12-09 19:26:05,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-12-09 19:26:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8793 states. [2018-12-09 19:26:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8793 to 7893. [2018-12-09 19:26:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2018-12-09 19:26:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 28711 transitions. [2018-12-09 19:26:05,266 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 28711 transitions. Word has length 60 [2018-12-09 19:26:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:05,267 INFO L480 AbstractCegarLoop]: Abstraction has 7893 states and 28711 transitions. [2018-12-09 19:26:05,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 19:26:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 28711 transitions. [2018-12-09 19:26:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:26:05,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:05,273 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-09 19:26:05,273 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:05,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:05,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2058615640, now seen corresponding path program 1 times [2018-12-09 19:26:05,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:05,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:26:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:05,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:05,733 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-09 19:26:05,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:05,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-09 19:26:05,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:05,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 19:26:05,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 19:26:05,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:26:05,733 INFO L87 Difference]: Start difference. First operand 7893 states and 28711 transitions. Second operand 20 states. [2018-12-09 19:26:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:06,007 INFO L93 Difference]: Finished difference Result 8949 states and 32183 transitions. [2018-12-09 19:26:06,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:26:06,007 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-09 19:26:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:06,017 INFO L225 Difference]: With dead ends: 8949 [2018-12-09 19:26:06,017 INFO L226 Difference]: Without dead ends: 7509 [2018-12-09 19:26:06,017 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-09 19:26:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7509 states. [2018-12-09 19:26:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7509 to 7509. [2018-12-09 19:26:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7509 states. [2018-12-09 19:26:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7509 states to 7509 states and 27191 transitions. [2018-12-09 19:26:06,103 INFO L78 Accepts]: Start accepts. Automaton has 7509 states and 27191 transitions. Word has length 60 [2018-12-09 19:26:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:06,103 INFO L480 AbstractCegarLoop]: Abstraction has 7509 states and 27191 transitions. [2018-12-09 19:26:06,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 19:26:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 7509 states and 27191 transitions. [2018-12-09 19:26:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:26:06,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:06,109 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-09 19:26:06,109 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:06,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:06,109 INFO L82 PathProgramCache]: Analyzing trace with hash -726446296, now seen corresponding path program 2 times [2018-12-09 19:26:06,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:06,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:06,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:06,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:06,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:06,597 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-09 19:26:06,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:06,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-09 19:26:06,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:06,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 19:26:06,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 19:26:06,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:26:06,598 INFO L87 Difference]: Start difference. First operand 7509 states and 27191 transitions. Second operand 20 states. [2018-12-09 19:26:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:06,883 INFO L93 Difference]: Finished difference Result 4917 states and 17063 transitions. [2018-12-09 19:26:06,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:26:06,884 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-09 19:26:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:06,888 INFO L225 Difference]: With dead ends: 4917 [2018-12-09 19:26:06,888 INFO L226 Difference]: Without dead ends: 3597 [2018-12-09 19:26:06,888 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-09 19:26:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2018-12-09 19:26:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3597. [2018-12-09 19:26:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-12-09 19:26:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 12663 transitions. [2018-12-09 19:26:06,922 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 12663 transitions. Word has length 60 [2018-12-09 19:26:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:06,922 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 12663 transitions. [2018-12-09 19:26:06,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 19:26:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 12663 transitions. [2018-12-09 19:26:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:26:06,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:06,924 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-09 19:26:06,925 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:06,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash -894531326, now seen corresponding path program 3 times [2018-12-09 19:26:06,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:06,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:06,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:26:06,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:06,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:07,358 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-09 19:26:07,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:07,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 19:26:07,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:07,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:26:07,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:26:07,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:26:07,359 INFO L87 Difference]: Start difference. First operand 3597 states and 12663 transitions. Second operand 19 states. [2018-12-09 19:26:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:07,651 INFO L93 Difference]: Finished difference Result 4296 states and 14936 transitions. [2018-12-09 19:26:07,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:26:07,651 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-12-09 19:26:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:07,655 INFO L225 Difference]: With dead ends: 4296 [2018-12-09 19:26:07,655 INFO L226 Difference]: Without dead ends: 3549 [2018-12-09 19:26:07,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-12-09 19:26:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2018-12-09 19:26:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3549. [2018-12-09 19:26:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-12-09 19:26:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 12499 transitions. [2018-12-09 19:26:07,689 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 12499 transitions. Word has length 60 [2018-12-09 19:26:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:07,689 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 12499 transitions. [2018-12-09 19:26:07,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:26:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 12499 transitions. [2018-12-09 19:26:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:26:07,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:07,691 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-09 19:26:07,692 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:07,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:07,692 INFO L82 PathProgramCache]: Analyzing trace with hash 314196332, now seen corresponding path program 4 times [2018-12-09 19:26:07,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:07,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:07,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:26:07,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:07,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:08,151 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-09 19:26:08,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:08,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 19:26:08,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:08,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:26:08,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:26:08,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:26:08,152 INFO L87 Difference]: Start difference. First operand 3549 states and 12499 transitions. Second operand 19 states. [2018-12-09 19:26:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:08,414 INFO L93 Difference]: Finished difference Result 882 states and 2688 transitions. [2018-12-09 19:26:08,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:26:08,414 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-12-09 19:26:08,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:08,414 INFO L225 Difference]: With dead ends: 882 [2018-12-09 19:26:08,414 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:26:08,414 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-09 19:26:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:26:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:26:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:26:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:26:08,415 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-12-09 19:26:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:08,415 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:26:08,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:26:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:26:08,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:26:08,417 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:26:08,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:26:08 BasicIcfg [2018-12-09 19:26:08,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:26:08,418 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:26:08,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:26:08,418 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:26:08,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:05" (3/4) ... [2018-12-09 19:26:08,420 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:26:08,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread0 [2018-12-09 19:26:08,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2018-12-09 19:26:08,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2018-12-09 19:26:08,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2018-12-09 19:26:08,427 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 19:26:08,427 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 19:26:08,448 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_db7cf3f2-be83-41c9-aa34-1bb4adc37039/bin-2019/utaipan/witness.graphml [2018-12-09 19:26:08,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:26:08,449 INFO L168 Benchmark]: Toolchain (without parser) took 63410.98 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 945.9 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-09 19:26:08,449 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:26:08,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -103.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:08,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:08,450 INFO L168 Benchmark]: Boogie Preprocessor took 15.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:26:08,450 INFO L168 Benchmark]: RCFGBuilder took 208.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:08,451 INFO L168 Benchmark]: TraceAbstraction took 62703.17 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-09 19:26:08,451 INFO L168 Benchmark]: Witness Printer took 30.59 ms. Allocated memory is still 5.4 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:26:08,452 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 422.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -103.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 208.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 62703.17 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 30.59 ms. Allocated memory is still 5.4 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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, 62.5s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 30.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6305 SDtfs, 17562 SDslu, 37142 SDs, 0 SdLazy, 15239 SolverSat, 2312 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 899 GetRequests, 99 SyntacticMatches, 42 SemanticMatches, 758 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3208 ImplicationChecksByTransitivity, 22.4s 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: 17.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 177045 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 1733 NumberOfCodeBlocks, 1733 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1700 ConstructedInterpolants, 0 QuantifiedInterpolants, 1552578 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...