./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/singleton_false-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_4e6d81da-3709-44fd-b384-5ee2b27a13e7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/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 7540c95af84ce36a44a847aa5fc0422896a0f0bd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 16:22:46,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:22:46,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:22:46,596 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:22:46,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:22:46,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:22:46,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:22:46,599 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:22:46,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:22:46,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:22:46,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:22:46,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:22:46,601 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:22:46,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:22:46,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:22:46,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:22:46,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:22:46,604 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:22:46,605 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:22:46,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:22:46,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:22:46,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:22:46,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:22:46,608 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:22:46,608 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:22:46,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:22:46,609 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:22:46,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:22:46,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:22:46,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:22:46,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:22:46,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:22:46,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:22:46,611 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:22:46,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:22:46,612 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:22:46,612 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 16:22:46,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:22:46,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:22:46,620 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:22:46,620 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:22:46,620 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:22:46,620 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:22:46,620 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:22:46,620 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:22:46,620 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:22:46,621 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:22:46,621 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:22:46,621 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:22:46,621 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:22:46,621 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:22:46,621 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:22:46,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:22:46,621 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:22:46,622 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:22:46,622 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 16:22:46,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:22:46,622 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 16:22:46,622 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:22:46,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 16:22:46,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 16:22:46,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:22:46,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:22:46,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:22:46,622 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:22:46,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:22:46,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:22:46,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:22:46,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 16:22:46,623 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:22:46,623 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:22:46,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:22:46,623 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 16:22:46,623 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_4e6d81da-3709-44fd-b384-5ee2b27a13e7/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 -> 7540c95af84ce36a44a847aa5fc0422896a0f0bd [2018-12-09 16:22:46,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:22:46,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:22:46,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:22:46,653 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:22:46,654 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:22:46,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/bin-2019/utaipan/../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i [2018-12-09 16:22:46,688 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/bin-2019/utaipan/data/f1f3ea072/e8889f78336945c1a8292aa38fa8a473/FLAGf811b8f3a [2018-12-09 16:22:47,016 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:22:47,016 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/sv-benchmarks/c/pthread/singleton_false-unreach-call.i [2018-12-09 16:22:47,024 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/bin-2019/utaipan/data/f1f3ea072/e8889f78336945c1a8292aa38fa8a473/FLAGf811b8f3a [2018-12-09 16:22:47,034 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/bin-2019/utaipan/data/f1f3ea072/e8889f78336945c1a8292aa38fa8a473 [2018-12-09 16:22:47,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:22:47,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:22:47,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:22:47,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:22:47,039 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:22:47,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:22:47" (1/1) ... [2018-12-09 16:22:47,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b6f768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47, skipping insertion in model container [2018-12-09 16:22:47,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:22:47" (1/1) ... [2018-12-09 16:22:47,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:22:47,069 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:22:47,301 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:22:47,307 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:22:47,370 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:22:47,437 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:22:47,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47 WrapperNode [2018-12-09 16:22:47,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:22:47,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:22:47,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:22:47,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:22:47,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47" (1/1) ... [2018-12-09 16:22:47,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47" (1/1) ... [2018-12-09 16:22:47,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:22:47,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:22:47,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:22:47,467 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:22:47,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47" (1/1) ... [2018-12-09 16:22:47,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47" (1/1) ... [2018-12-09 16:22:47,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47" (1/1) ... [2018-12-09 16:22:47,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47" (1/1) ... [2018-12-09 16:22:47,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47" (1/1) ... [2018-12-09 16:22:47,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47" (1/1) ... [2018-12-09 16:22:47,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47" (1/1) ... [2018-12-09 16:22:47,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:22:47,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:22:47,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:22:47,483 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:22:47,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/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 16:22:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:22:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:22:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 16:22:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2018-12-09 16:22:47,517 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2018-12-09 16:22:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2018-12-09 16:22:47,517 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2018-12-09 16:22:47,518 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2018-12-09 16:22:47,518 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2018-12-09 16:22:47,518 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2018-12-09 16:22:47,518 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2018-12-09 16:22:47,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 16:22:47,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:22:47,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:22:47,519 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 16:22:47,709 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:22:47,710 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 16:22:47,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:22:47 BoogieIcfgContainer [2018-12-09 16:22:47,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:22:47,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:22:47,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:22:47,714 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:22:47,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:22:47" (1/3) ... [2018-12-09 16:22:47,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37296342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:22:47, skipping insertion in model container [2018-12-09 16:22:47,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:47" (2/3) ... [2018-12-09 16:22:47,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37296342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:22:47, skipping insertion in model container [2018-12-09 16:22:47,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:22:47" (3/3) ... [2018-12-09 16:22:47,716 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_false-unreach-call.i [2018-12-09 16:22:47,750 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,750 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,750 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,751 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,751 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,751 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,752 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,755 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,755 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,755 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,755 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,755 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,756 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,756 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,756 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,756 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,756 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,756 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,756 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,757 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,757 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,757 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,757 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,757 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,757 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,757 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,757 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,758 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,758 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,758 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,758 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,758 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,759 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,759 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,759 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,759 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,759 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,760 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,760 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,760 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,760 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,760 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,760 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,761 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,761 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,761 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,761 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,761 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,762 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,762 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,762 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,762 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,762 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,763 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,763 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,763 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,763 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,763 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,764 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,764 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,764 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,764 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,764 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,765 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,765 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,765 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,765 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,766 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,766 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,766 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,766 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,767 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,767 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,768 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,768 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:22:47,864 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 16:22:47,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:22:47,869 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 16:22:47,878 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 16:22:47,893 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:22:47,893 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 16:22:47,893 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:22:47,893 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:22:47,893 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:22:47,893 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:22:47,893 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:22:47,893 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:22:47,900 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139places, 232 transitions [2018-12-09 16:22:50,275 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47312 states. [2018-12-09 16:22:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 47312 states. [2018-12-09 16:22:50,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 16:22:50,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:50,282 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] [2018-12-09 16:22:50,283 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:22:50,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:50,287 INFO L82 PathProgramCache]: Analyzing trace with hash 537396033, now seen corresponding path program 1 times [2018-12-09 16:22:50,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:50,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:50,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:50,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:50,505 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 16:22:50,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:50,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 16:22:50,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:50,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 16:22:50,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 16:22:50,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:22:50,520 INFO L87 Difference]: Start difference. First operand 47312 states. Second operand 10 states. [2018-12-09 16:22:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:51,161 INFO L93 Difference]: Finished difference Result 53969 states and 232570 transitions. [2018-12-09 16:22:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 16:22:51,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-12-09 16:22:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:51,332 INFO L225 Difference]: With dead ends: 53969 [2018-12-09 16:22:51,332 INFO L226 Difference]: Without dead ends: 38044 [2018-12-09 16:22:51,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-12-09 16:22:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38044 states. [2018-12-09 16:22:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38044 to 31405. [2018-12-09 16:22:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31405 states. [2018-12-09 16:22:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31405 states to 31405 states and 135819 transitions. [2018-12-09 16:22:52,169 INFO L78 Accepts]: Start accepts. Automaton has 31405 states and 135819 transitions. Word has length 31 [2018-12-09 16:22:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:52,170 INFO L480 AbstractCegarLoop]: Abstraction has 31405 states and 135819 transitions. [2018-12-09 16:22:52,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 16:22:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 31405 states and 135819 transitions. [2018-12-09 16:22:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 16:22:52,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:52,172 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] [2018-12-09 16:22:52,172 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:22:52,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:52,172 INFO L82 PathProgramCache]: Analyzing trace with hash -756897297, now seen corresponding path program 2 times [2018-12-09 16:22:52,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:52,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:52,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:52,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:52,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:22:52,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:52,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 16:22:52,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:52,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 16:22:52,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 16:22:52,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:22:52,287 INFO L87 Difference]: Start difference. First operand 31405 states and 135819 transitions. Second operand 10 states. [2018-12-09 16:22:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:52,782 INFO L93 Difference]: Finished difference Result 44657 states and 198278 transitions. [2018-12-09 16:22:52,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:22:52,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-12-09 16:22:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:52,893 INFO L225 Difference]: With dead ends: 44657 [2018-12-09 16:22:52,893 INFO L226 Difference]: Without dead ends: 44657 [2018-12-09 16:22:52,893 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 16:22:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44657 states. [2018-12-09 16:22:53,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44657 to 31363. [2018-12-09 16:22:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31363 states. [2018-12-09 16:22:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31363 states to 31363 states and 135747 transitions. [2018-12-09 16:22:53,748 INFO L78 Accepts]: Start accepts. Automaton has 31363 states and 135747 transitions. Word has length 31 [2018-12-09 16:22:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:53,748 INFO L480 AbstractCegarLoop]: Abstraction has 31363 states and 135747 transitions. [2018-12-09 16:22:53,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 16:22:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 31363 states and 135747 transitions. [2018-12-09 16:22:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 16:22:53,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:53,752 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] [2018-12-09 16:22:53,752 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:22:53,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash 825642035, now seen corresponding path program 1 times [2018-12-09 16:22:53,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:53,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:53,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:22:53,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:53,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:53,791 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 16:22:53,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:53,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:22:53,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:53,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:22:53,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:22:53,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:22:53,792 INFO L87 Difference]: Start difference. First operand 31363 states and 135747 transitions. Second operand 6 states. [2018-12-09 16:22:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:54,184 INFO L93 Difference]: Finished difference Result 67819 states and 285625 transitions. [2018-12-09 16:22:54,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 16:22:54,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-12-09 16:22:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:54,286 INFO L225 Difference]: With dead ends: 67819 [2018-12-09 16:22:54,287 INFO L226 Difference]: Without dead ends: 41885 [2018-12-09 16:22:54,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 16:22:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41885 states. [2018-12-09 16:22:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41885 to 32363. [2018-12-09 16:22:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32363 states. [2018-12-09 16:22:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32363 states to 32363 states and 134937 transitions. [2018-12-09 16:22:55,060 INFO L78 Accepts]: Start accepts. Automaton has 32363 states and 134937 transitions. Word has length 41 [2018-12-09 16:22:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:55,061 INFO L480 AbstractCegarLoop]: Abstraction has 32363 states and 134937 transitions. [2018-12-09 16:22:55,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:22:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 32363 states and 134937 transitions. [2018-12-09 16:22:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 16:22:55,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:55,067 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] [2018-12-09 16:22:55,067 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:22:55,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:55,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1767070092, now seen corresponding path program 1 times [2018-12-09 16:22:55,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:55,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:55,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:55,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:55,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:55,142 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 16:22:55,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:55,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:22:55,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:55,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:22:55,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:22:55,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:22:55,143 INFO L87 Difference]: Start difference. First operand 32363 states and 134937 transitions. Second operand 7 states. [2018-12-09 16:22:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:55,446 INFO L93 Difference]: Finished difference Result 39181 states and 163715 transitions. [2018-12-09 16:22:55,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 16:22:55,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-12-09 16:22:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:55,525 INFO L225 Difference]: With dead ends: 39181 [2018-12-09 16:22:55,525 INFO L226 Difference]: Without dead ends: 39109 [2018-12-09 16:22:55,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-09 16:22:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39109 states. [2018-12-09 16:22:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39109 to 35466. [2018-12-09 16:22:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35466 states. [2018-12-09 16:22:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35466 states to 35466 states and 149245 transitions. [2018-12-09 16:22:56,118 INFO L78 Accepts]: Start accepts. Automaton has 35466 states and 149245 transitions. Word has length 43 [2018-12-09 16:22:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:56,118 INFO L480 AbstractCegarLoop]: Abstraction has 35466 states and 149245 transitions. [2018-12-09 16:22:56,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:22:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 35466 states and 149245 transitions. [2018-12-09 16:22:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 16:22:56,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:56,125 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] [2018-12-09 16:22:56,126 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:22:56,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:56,126 INFO L82 PathProgramCache]: Analyzing trace with hash -638377908, now seen corresponding path program 2 times [2018-12-09 16:22:56,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:56,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:56,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:56,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:56,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:56,233 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 16:22:56,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:56,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 16:22:56,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:56,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 16:22:56,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 16:22:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:22:56,234 INFO L87 Difference]: Start difference. First operand 35466 states and 149245 transitions. Second operand 10 states. [2018-12-09 16:22:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:56,650 INFO L93 Difference]: Finished difference Result 49948 states and 204487 transitions. [2018-12-09 16:22:56,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 16:22:56,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-09 16:22:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:56,886 INFO L225 Difference]: With dead ends: 49948 [2018-12-09 16:22:56,886 INFO L226 Difference]: Without dead ends: 45132 [2018-12-09 16:22:56,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-12-09 16:22:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45132 states. [2018-12-09 16:22:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45132 to 35381. [2018-12-09 16:22:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35381 states. [2018-12-09 16:22:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35381 states to 35381 states and 148987 transitions. [2018-12-09 16:22:57,471 INFO L78 Accepts]: Start accepts. Automaton has 35381 states and 148987 transitions. Word has length 43 [2018-12-09 16:22:57,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:57,472 INFO L480 AbstractCegarLoop]: Abstraction has 35381 states and 148987 transitions. [2018-12-09 16:22:57,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 16:22:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35381 states and 148987 transitions. [2018-12-09 16:22:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 16:22:57,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:57,479 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] [2018-12-09 16:22:57,479 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:22:57,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:57,480 INFO L82 PathProgramCache]: Analyzing trace with hash 703641554, now seen corresponding path program 1 times [2018-12-09 16:22:57,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:57,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:57,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:22:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:57,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:57,547 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 16:22:57,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:57,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:22:57,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:57,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:22:57,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:22:57,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:22:57,548 INFO L87 Difference]: Start difference. First operand 35381 states and 148987 transitions. Second operand 7 states. [2018-12-09 16:22:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:57,839 INFO L93 Difference]: Finished difference Result 38268 states and 158857 transitions. [2018-12-09 16:22:57,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 16:22:57,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-12-09 16:22:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:57,912 INFO L225 Difference]: With dead ends: 38268 [2018-12-09 16:22:57,912 INFO L226 Difference]: Without dead ends: 37788 [2018-12-09 16:22:57,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-09 16:22:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37788 states. [2018-12-09 16:22:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37788 to 36092. [2018-12-09 16:22:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36092 states. [2018-12-09 16:22:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36092 states to 36092 states and 150963 transitions. [2018-12-09 16:22:58,624 INFO L78 Accepts]: Start accepts. Automaton has 36092 states and 150963 transitions. Word has length 44 [2018-12-09 16:22:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:58,624 INFO L480 AbstractCegarLoop]: Abstraction has 36092 states and 150963 transitions. [2018-12-09 16:22:58,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:22:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 36092 states and 150963 transitions. [2018-12-09 16:22:58,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 16:22:58,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:58,632 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] [2018-12-09 16:22:58,632 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:22:58,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:58,633 INFO L82 PathProgramCache]: Analyzing trace with hash -273083420, now seen corresponding path program 2 times [2018-12-09 16:22:58,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:58,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:58,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:58,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:58,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:58,929 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 16:22:58,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:58,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 16:22:58,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:58,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 16:22:58,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 16:22:58,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-09 16:22:58,930 INFO L87 Difference]: Start difference. First operand 36092 states and 150963 transitions. Second operand 17 states. [2018-12-09 16:22:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:59,766 INFO L93 Difference]: Finished difference Result 43003 states and 180466 transitions. [2018-12-09 16:22:59,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 16:22:59,766 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-09 16:22:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:59,848 INFO L225 Difference]: With dead ends: 43003 [2018-12-09 16:22:59,849 INFO L226 Difference]: Without dead ends: 42757 [2018-12-09 16:22:59,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2018-12-09 16:22:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42757 states. [2018-12-09 16:23:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42757 to 39101. [2018-12-09 16:23:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39101 states. [2018-12-09 16:23:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39101 states to 39101 states and 165551 transitions. [2018-12-09 16:23:00,496 INFO L78 Accepts]: Start accepts. Automaton has 39101 states and 165551 transitions. Word has length 44 [2018-12-09 16:23:00,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:00,497 INFO L480 AbstractCegarLoop]: Abstraction has 39101 states and 165551 transitions. [2018-12-09 16:23:00,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 16:23:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 39101 states and 165551 transitions. [2018-12-09 16:23:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 16:23:00,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:00,507 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] [2018-12-09 16:23:00,508 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:00,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1145868854, now seen corresponding path program 3 times [2018-12-09 16:23:00,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:00,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:00,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:23:00,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:00,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:00,695 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 16:23:00,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:00,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 16:23:00,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:00,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 16:23:00,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 16:23:00,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-09 16:23:00,695 INFO L87 Difference]: Start difference. First operand 39101 states and 165551 transitions. Second operand 14 states. [2018-12-09 16:23:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:01,155 INFO L93 Difference]: Finished difference Result 52387 states and 222062 transitions. [2018-12-09 16:23:01,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 16:23:01,155 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-12-09 16:23:01,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:01,283 INFO L225 Difference]: With dead ends: 52387 [2018-12-09 16:23:01,283 INFO L226 Difference]: Without dead ends: 52141 [2018-12-09 16:23:01,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-12-09 16:23:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52141 states. [2018-12-09 16:23:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52141 to 39028. [2018-12-09 16:23:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39028 states. [2018-12-09 16:23:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39028 states to 39028 states and 165324 transitions. [2018-12-09 16:23:02,094 INFO L78 Accepts]: Start accepts. Automaton has 39028 states and 165324 transitions. Word has length 44 [2018-12-09 16:23:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:02,095 INFO L480 AbstractCegarLoop]: Abstraction has 39028 states and 165324 transitions. [2018-12-09 16:23:02,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 16:23:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 39028 states and 165324 transitions. [2018-12-09 16:23:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 16:23:02,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:02,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] [2018-12-09 16:23:02,109 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:02,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:02,109 INFO L82 PathProgramCache]: Analyzing trace with hash -924841218, now seen corresponding path program 1 times [2018-12-09 16:23:02,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:02,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:02,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:23:02,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:02,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:02,575 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 16:23:02,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-09 16:23:02,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:02,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 16:23:02,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 16:23:02,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-12-09 16:23:02,576 INFO L87 Difference]: Start difference. First operand 39028 states and 165324 transitions. Second operand 20 states. [2018-12-09 16:23:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:04,824 INFO L93 Difference]: Finished difference Result 54953 states and 225523 transitions. [2018-12-09 16:23:04,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 16:23:04,824 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-12-09 16:23:04,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:04,924 INFO L225 Difference]: With dead ends: 54953 [2018-12-09 16:23:04,924 INFO L226 Difference]: Without dead ends: 50049 [2018-12-09 16:23:04,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=462, Invalid=1794, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 16:23:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50049 states. [2018-12-09 16:23:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50049 to 39103. [2018-12-09 16:23:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39103 states. [2018-12-09 16:23:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39103 states to 39103 states and 165629 transitions. [2018-12-09 16:23:05,708 INFO L78 Accepts]: Start accepts. Automaton has 39103 states and 165629 transitions. Word has length 46 [2018-12-09 16:23:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:05,708 INFO L480 AbstractCegarLoop]: Abstraction has 39103 states and 165629 transitions. [2018-12-09 16:23:05,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 16:23:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 39103 states and 165629 transitions. [2018-12-09 16:23:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 16:23:05,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:05,722 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] [2018-12-09 16:23:05,722 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:05,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1687924148, now seen corresponding path program 2 times [2018-12-09 16:23:05,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:05,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:05,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:05,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:05,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 16:23:05,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:05,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 16:23:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 16:23:05,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:23:05,853 INFO L87 Difference]: Start difference. First operand 39103 states and 165629 transitions. Second operand 12 states. [2018-12-09 16:23:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:06,348 INFO L93 Difference]: Finished difference Result 55473 states and 227887 transitions. [2018-12-09 16:23:06,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 16:23:06,349 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-12-09 16:23:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:06,443 INFO L225 Difference]: With dead ends: 55473 [2018-12-09 16:23:06,443 INFO L226 Difference]: Without dead ends: 48829 [2018-12-09 16:23:06,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-12-09 16:23:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48829 states. [2018-12-09 16:23:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48829 to 38756. [2018-12-09 16:23:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38756 states. [2018-12-09 16:23:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38756 states to 38756 states and 164262 transitions. [2018-12-09 16:23:07,130 INFO L78 Accepts]: Start accepts. Automaton has 38756 states and 164262 transitions. Word has length 46 [2018-12-09 16:23:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:07,131 INFO L480 AbstractCegarLoop]: Abstraction has 38756 states and 164262 transitions. [2018-12-09 16:23:07,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 16:23:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 38756 states and 164262 transitions. [2018-12-09 16:23:07,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 16:23:07,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:07,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] [2018-12-09 16:23:07,145 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:07,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:07,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2121874178, now seen corresponding path program 1 times [2018-12-09 16:23:07,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:07,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:07,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:23:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:07,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:07,490 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 16:23:07,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:07,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 16:23:07,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:07,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 16:23:07,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 16:23:07,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-09 16:23:07,491 INFO L87 Difference]: Start difference. First operand 38756 states and 164262 transitions. Second operand 17 states. [2018-12-09 16:23:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:08,721 INFO L93 Difference]: Finished difference Result 47709 states and 201870 transitions. [2018-12-09 16:23:08,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 16:23:08,721 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-09 16:23:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:08,811 INFO L225 Difference]: With dead ends: 47709 [2018-12-09 16:23:08,811 INFO L226 Difference]: Without dead ends: 47403 [2018-12-09 16:23:08,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2018-12-09 16:23:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47403 states. [2018-12-09 16:23:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47403 to 40796. [2018-12-09 16:23:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40796 states. [2018-12-09 16:23:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40796 states to 40796 states and 173951 transitions. [2018-12-09 16:23:09,724 INFO L78 Accepts]: Start accepts. Automaton has 40796 states and 173951 transitions. Word has length 46 [2018-12-09 16:23:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:09,724 INFO L480 AbstractCegarLoop]: Abstraction has 40796 states and 173951 transitions. [2018-12-09 16:23:09,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 16:23:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 40796 states and 173951 transitions. [2018-12-09 16:23:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 16:23:09,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:09,738 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] [2018-12-09 16:23:09,739 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:09,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash 89732511, now seen corresponding path program 1 times [2018-12-09 16:23:09,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:09,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:10,067 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 16:23:10,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:10,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 16:23:10,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:10,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 16:23:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 16:23:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-09 16:23:10,068 INFO L87 Difference]: Start difference. First operand 40796 states and 173951 transitions. Second operand 17 states. [2018-12-09 16:23:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:11,049 INFO L93 Difference]: Finished difference Result 48941 states and 207557 transitions. [2018-12-09 16:23:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 16:23:11,049 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-09 16:23:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:11,144 INFO L225 Difference]: With dead ends: 48941 [2018-12-09 16:23:11,144 INFO L226 Difference]: Without dead ends: 48635 [2018-12-09 16:23:11,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-12-09 16:23:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48635 states. [2018-12-09 16:23:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48635 to 40772. [2018-12-09 16:23:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40772 states. [2018-12-09 16:23:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40772 states to 40772 states and 173863 transitions. [2018-12-09 16:23:11,837 INFO L78 Accepts]: Start accepts. Automaton has 40772 states and 173863 transitions. Word has length 46 [2018-12-09 16:23:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:11,837 INFO L480 AbstractCegarLoop]: Abstraction has 40772 states and 173863 transitions. [2018-12-09 16:23:11,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 16:23:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 40772 states and 173863 transitions. [2018-12-09 16:23:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 16:23:11,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:11,851 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] [2018-12-09 16:23:11,851 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:11,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:11,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1822746999, now seen corresponding path program 2 times [2018-12-09 16:23:11,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:11,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:11,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:11,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:11,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:12,181 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 16:23:12,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:12,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 16:23:12,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:12,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 16:23:12,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 16:23:12,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-09 16:23:12,182 INFO L87 Difference]: Start difference. First operand 40772 states and 173863 transitions. Second operand 17 states. [2018-12-09 16:23:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:13,270 INFO L93 Difference]: Finished difference Result 49993 states and 209684 transitions. [2018-12-09 16:23:13,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 16:23:13,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-09 16:23:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:13,371 INFO L225 Difference]: With dead ends: 49993 [2018-12-09 16:23:13,372 INFO L226 Difference]: Without dead ends: 49687 [2018-12-09 16:23:13,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 16:23:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49687 states. [2018-12-09 16:23:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49687 to 38645. [2018-12-09 16:23:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38645 states. [2018-12-09 16:23:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38645 states to 38645 states and 163925 transitions. [2018-12-09 16:23:14,064 INFO L78 Accepts]: Start accepts. Automaton has 38645 states and 163925 transitions. Word has length 46 [2018-12-09 16:23:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:14,064 INFO L480 AbstractCegarLoop]: Abstraction has 38645 states and 163925 transitions. [2018-12-09 16:23:14,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 16:23:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 38645 states and 163925 transitions. [2018-12-09 16:23:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 16:23:14,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:14,078 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] [2018-12-09 16:23:14,079 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:14,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:14,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1548751685, now seen corresponding path program 1 times [2018-12-09 16:23:14,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:14,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:14,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:23:14,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:14,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:14,280 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-12-09 16:23:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:14,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:14,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 16:23:14,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:14,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 16:23:14,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 16:23:14,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:23:14,653 INFO L87 Difference]: Start difference. First operand 38645 states and 163925 transitions. Second operand 19 states. [2018-12-09 16:23:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:15,628 INFO L93 Difference]: Finished difference Result 48949 states and 208196 transitions. [2018-12-09 16:23:15,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 16:23:15,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-12-09 16:23:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:15,724 INFO L225 Difference]: With dead ends: 48949 [2018-12-09 16:23:15,724 INFO L226 Difference]: Without dead ends: 48703 [2018-12-09 16:23:15,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-12-09 16:23:15,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48703 states. [2018-12-09 16:23:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48703 to 38308. [2018-12-09 16:23:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38308 states. [2018-12-09 16:23:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38308 states to 38308 states and 162641 transitions. [2018-12-09 16:23:16,401 INFO L78 Accepts]: Start accepts. Automaton has 38308 states and 162641 transitions. Word has length 46 [2018-12-09 16:23:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:16,401 INFO L480 AbstractCegarLoop]: Abstraction has 38308 states and 162641 transitions. [2018-12-09 16:23:16,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 16:23:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 38308 states and 162641 transitions. [2018-12-09 16:23:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 16:23:16,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:16,414 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] [2018-12-09 16:23:16,414 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:16,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:16,414 INFO L82 PathProgramCache]: Analyzing trace with hash -475658810, now seen corresponding path program 2 times [2018-12-09 16:23:16,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:16,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:16,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:16,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:16,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:16,517 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 16:23:16,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:16,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 16:23:16,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:16,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 16:23:16,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 16:23:16,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:23:16,518 INFO L87 Difference]: Start difference. First operand 38308 states and 162641 transitions. Second operand 12 states. [2018-12-09 16:23:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:16,980 INFO L93 Difference]: Finished difference Result 52333 states and 220932 transitions. [2018-12-09 16:23:16,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 16:23:16,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-12-09 16:23:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:17,089 INFO L225 Difference]: With dead ends: 52333 [2018-12-09 16:23:17,089 INFO L226 Difference]: Without dead ends: 52027 [2018-12-09 16:23:17,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-12-09 16:23:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2018-12-09 16:23:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 38150. [2018-12-09 16:23:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38150 states. [2018-12-09 16:23:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38150 states to 38150 states and 162226 transitions. [2018-12-09 16:23:17,786 INFO L78 Accepts]: Start accepts. Automaton has 38150 states and 162226 transitions. Word has length 46 [2018-12-09 16:23:17,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:17,787 INFO L480 AbstractCegarLoop]: Abstraction has 38150 states and 162226 transitions. [2018-12-09 16:23:17,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 16:23:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 38150 states and 162226 transitions. [2018-12-09 16:23:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 16:23:17,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:17,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:23:17,805 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:17,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:17,805 INFO L82 PathProgramCache]: Analyzing trace with hash -712228033, now seen corresponding path program 1 times [2018-12-09 16:23:17,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:17,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:17,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:23:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:17,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:18,238 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 16:23:18,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:18,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 16:23:18,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:18,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 16:23:18,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 16:23:18,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:23:18,239 INFO L87 Difference]: Start difference. First operand 38150 states and 162226 transitions. Second operand 19 states. [2018-12-09 16:23:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:19,113 INFO L93 Difference]: Finished difference Result 46294 states and 195371 transitions. [2018-12-09 16:23:19,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 16:23:19,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-12-09 16:23:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:19,203 INFO L225 Difference]: With dead ends: 46294 [2018-12-09 16:23:19,203 INFO L226 Difference]: Without dead ends: 45988 [2018-12-09 16:23:19,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-12-09 16:23:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45988 states. [2018-12-09 16:23:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45988 to 36584. [2018-12-09 16:23:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36584 states. [2018-12-09 16:23:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36584 states to 36584 states and 155048 transitions. [2018-12-09 16:23:19,885 INFO L78 Accepts]: Start accepts. Automaton has 36584 states and 155048 transitions. Word has length 48 [2018-12-09 16:23:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:19,885 INFO L480 AbstractCegarLoop]: Abstraction has 36584 states and 155048 transitions. [2018-12-09 16:23:19,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 16:23:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 36584 states and 155048 transitions. [2018-12-09 16:23:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 16:23:19,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:19,909 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 16:23:19,909 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:19,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1120442176, now seen corresponding path program 1 times [2018-12-09 16:23:19,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:19,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:19,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:19,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:20,166 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-12-09 16:23:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:20,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:20,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-09 16:23:20,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:20,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 16:23:20,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 16:23:20,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-09 16:23:20,524 INFO L87 Difference]: Start difference. First operand 36584 states and 155048 transitions. Second operand 18 states. [2018-12-09 16:23:20,752 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-09 16:23:21,352 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-12-09 16:23:21,683 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2018-12-09 16:23:22,046 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2018-12-09 16:23:22,468 WARN L180 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-12-09 16:23:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:23,167 INFO L93 Difference]: Finished difference Result 42357 states and 177918 transitions. [2018-12-09 16:23:23,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 16:23:23,168 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-12-09 16:23:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:23,268 INFO L225 Difference]: With dead ends: 42357 [2018-12-09 16:23:23,268 INFO L226 Difference]: Without dead ends: 42051 [2018-12-09 16:23:23,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-12-09 16:23:23,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42051 states. [2018-12-09 16:23:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42051 to 34160. [2018-12-09 16:23:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34160 states. [2018-12-09 16:23:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34160 states to 34160 states and 144012 transitions. [2018-12-09 16:23:23,875 INFO L78 Accepts]: Start accepts. Automaton has 34160 states and 144012 transitions. Word has length 48 [2018-12-09 16:23:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:23,876 INFO L480 AbstractCegarLoop]: Abstraction has 34160 states and 144012 transitions. [2018-12-09 16:23:23,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 16:23:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 34160 states and 144012 transitions. [2018-12-09 16:23:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 16:23:23,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:23,895 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] [2018-12-09 16:23:23,895 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:23,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:23,895 INFO L82 PathProgramCache]: Analyzing trace with hash 799656368, now seen corresponding path program 1 times [2018-12-09 16:23:23,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:23,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:23,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:23,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:23,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:23,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:23,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:23:23,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:23,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:23:23,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:23:23,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:23:23,965 INFO L87 Difference]: Start difference. First operand 34160 states and 144012 transitions. Second operand 7 states. [2018-12-09 16:23:24,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:24,241 INFO L93 Difference]: Finished difference Result 38880 states and 161858 transitions. [2018-12-09 16:23:24,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 16:23:24,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-12-09 16:23:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:24,314 INFO L225 Difference]: With dead ends: 38880 [2018-12-09 16:23:24,314 INFO L226 Difference]: Without dead ends: 38046 [2018-12-09 16:23:24,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-09 16:23:24,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38046 states. [2018-12-09 16:23:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38046 to 36228. [2018-12-09 16:23:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36228 states. [2018-12-09 16:23:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36228 states to 36228 states and 152400 transitions. [2018-12-09 16:23:24,899 INFO L78 Accepts]: Start accepts. Automaton has 36228 states and 152400 transitions. Word has length 49 [2018-12-09 16:23:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:24,899 INFO L480 AbstractCegarLoop]: Abstraction has 36228 states and 152400 transitions. [2018-12-09 16:23:24,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:23:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 36228 states and 152400 transitions. [2018-12-09 16:23:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 16:23:24,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:24,918 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] [2018-12-09 16:23:24,918 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:24,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1212289711, now seen corresponding path program 1 times [2018-12-09 16:23:24,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:24,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:24,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:24,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:24,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:25,082 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 16:23:25,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:25,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 16:23:25,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:25,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 16:23:25,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 16:23:25,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-09 16:23:25,083 INFO L87 Difference]: Start difference. First operand 36228 states and 152400 transitions. Second operand 14 states. [2018-12-09 16:23:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:25,630 INFO L93 Difference]: Finished difference Result 55817 states and 227535 transitions. [2018-12-09 16:23:25,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 16:23:25,631 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-12-09 16:23:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:25,710 INFO L225 Difference]: With dead ends: 55817 [2018-12-09 16:23:25,710 INFO L226 Difference]: Without dead ends: 41649 [2018-12-09 16:23:25,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-12-09 16:23:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41649 states. [2018-12-09 16:23:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41649 to 31649. [2018-12-09 16:23:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31649 states. [2018-12-09 16:23:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31649 states to 31649 states and 132071 transitions. [2018-12-09 16:23:26,281 INFO L78 Accepts]: Start accepts. Automaton has 31649 states and 132071 transitions. Word has length 49 [2018-12-09 16:23:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:26,281 INFO L480 AbstractCegarLoop]: Abstraction has 31649 states and 132071 transitions. [2018-12-09 16:23:26,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 16:23:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 31649 states and 132071 transitions. [2018-12-09 16:23:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 16:23:26,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:26,298 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] [2018-12-09 16:23:26,298 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:26,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1269167334, now seen corresponding path program 1 times [2018-12-09 16:23:26,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:26,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:26,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:26,957 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 16:23:26,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:26,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 16:23:26,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:26,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 16:23:26,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 16:23:26,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:23:26,958 INFO L87 Difference]: Start difference. First operand 31649 states and 132071 transitions. Second operand 21 states. [2018-12-09 16:23:27,568 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2018-12-09 16:23:28,165 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2018-12-09 16:23:28,431 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2018-12-09 16:23:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:30,130 INFO L93 Difference]: Finished difference Result 55168 states and 228464 transitions. [2018-12-09 16:23:30,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-09 16:23:30,130 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-12-09 16:23:30,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:30,242 INFO L225 Difference]: With dead ends: 55168 [2018-12-09 16:23:30,242 INFO L226 Difference]: Without dead ends: 54346 [2018-12-09 16:23:30,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=542, Invalid=1908, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 16:23:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54346 states. [2018-12-09 16:23:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54346 to 35364. [2018-12-09 16:23:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-09 16:23:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 150822 transitions. [2018-12-09 16:23:30,942 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 150822 transitions. Word has length 49 [2018-12-09 16:23:30,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:30,942 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 150822 transitions. [2018-12-09 16:23:30,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 16:23:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 150822 transitions. [2018-12-09 16:23:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 16:23:30,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:30,964 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] [2018-12-09 16:23:30,964 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:30,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash 710299090, now seen corresponding path program 2 times [2018-12-09 16:23:30,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:30,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:30,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:30,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:30,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:31,185 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 16:23:31,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:31,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-09 16:23:31,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:31,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 16:23:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 16:23:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-09 16:23:31,186 INFO L87 Difference]: Start difference. First operand 35364 states and 150822 transitions. Second operand 16 states. [2018-12-09 16:23:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:31,584 INFO L93 Difference]: Finished difference Result 39597 states and 166907 transitions. [2018-12-09 16:23:31,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:23:31,584 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-12-09 16:23:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:31,660 INFO L225 Difference]: With dead ends: 39597 [2018-12-09 16:23:31,660 INFO L226 Difference]: Without dead ends: 38958 [2018-12-09 16:23:31,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-12-09 16:23:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38958 states. [2018-12-09 16:23:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38958 to 35364. [2018-12-09 16:23:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-09 16:23:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 150822 transitions. [2018-12-09 16:23:32,234 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 150822 transitions. Word has length 49 [2018-12-09 16:23:32,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:32,235 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 150822 transitions. [2018-12-09 16:23:32,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 16:23:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 150822 transitions. [2018-12-09 16:23:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 16:23:32,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:32,255 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] [2018-12-09 16:23:32,255 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:32,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash 227988774, now seen corresponding path program 3 times [2018-12-09 16:23:32,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:32,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:23:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:32,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:32,650 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 16:23:32,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:32,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 16:23:32,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:32,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 16:23:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 16:23:32,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:23:32,651 INFO L87 Difference]: Start difference. First operand 35364 states and 150822 transitions. Second operand 19 states. [2018-12-09 16:23:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:33,582 INFO L93 Difference]: Finished difference Result 41619 states and 175078 transitions. [2018-12-09 16:23:33,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 16:23:33,582 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-09 16:23:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:33,661 INFO L225 Difference]: With dead ends: 41619 [2018-12-09 16:23:33,662 INFO L226 Difference]: Without dead ends: 40980 [2018-12-09 16:23:33,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2018-12-09 16:23:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40980 states. [2018-12-09 16:23:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40980 to 35412. [2018-12-09 16:23:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35412 states. [2018-12-09 16:23:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35412 states to 35412 states and 150956 transitions. [2018-12-09 16:23:34,259 INFO L78 Accepts]: Start accepts. Automaton has 35412 states and 150956 transitions. Word has length 49 [2018-12-09 16:23:34,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:34,259 INFO L480 AbstractCegarLoop]: Abstraction has 35412 states and 150956 transitions. [2018-12-09 16:23:34,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 16:23:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 35412 states and 150956 transitions. [2018-12-09 16:23:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 16:23:34,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:34,279 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] [2018-12-09 16:23:34,279 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:34,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:34,280 INFO L82 PathProgramCache]: Analyzing trace with hash -344784414, now seen corresponding path program 4 times [2018-12-09 16:23:34,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:34,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:23:34,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:34,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:34,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:34,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-09 16:23:34,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:34,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 16:23:34,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 16:23:34,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-09 16:23:34,503 INFO L87 Difference]: Start difference. First operand 35412 states and 150956 transitions. Second operand 16 states. [2018-12-09 16:23:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:35,001 INFO L93 Difference]: Finished difference Result 44552 states and 186042 transitions. [2018-12-09 16:23:35,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 16:23:35,001 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-12-09 16:23:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:35,086 INFO L225 Difference]: With dead ends: 44552 [2018-12-09 16:23:35,086 INFO L226 Difference]: Without dead ends: 43913 [2018-12-09 16:23:35,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2018-12-09 16:23:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43913 states. [2018-12-09 16:23:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43913 to 34825. [2018-12-09 16:23:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34825 states. [2018-12-09 16:23:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34825 states to 34825 states and 148359 transitions. [2018-12-09 16:23:35,689 INFO L78 Accepts]: Start accepts. Automaton has 34825 states and 148359 transitions. Word has length 49 [2018-12-09 16:23:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:35,689 INFO L480 AbstractCegarLoop]: Abstraction has 34825 states and 148359 transitions. [2018-12-09 16:23:35,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 16:23:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 34825 states and 148359 transitions. [2018-12-09 16:23:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:23:35,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:35,714 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] [2018-12-09 16:23:35,714 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:35,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:35,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1190448904, now seen corresponding path program 1 times [2018-12-09 16:23:35,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:35,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:35,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:35,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:35,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:36,374 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 16:23:36,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:36,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 16:23:36,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:36,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 16:23:36,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 16:23:36,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:23:36,375 INFO L87 Difference]: Start difference. First operand 34825 states and 148359 transitions. Second operand 21 states. [2018-12-09 16:23:36,834 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2018-12-09 16:23:37,022 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2018-12-09 16:23:37,551 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2018-12-09 16:23:38,327 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2018-12-09 16:23:39,640 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2018-12-09 16:23:40,074 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2018-12-09 16:23:40,536 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2018-12-09 16:23:40,723 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2018-12-09 16:23:41,521 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2018-12-09 16:23:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:41,718 INFO L93 Difference]: Finished difference Result 36224 states and 150699 transitions. [2018-12-09 16:23:41,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 16:23:41,720 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-09 16:23:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:41,807 INFO L225 Difference]: With dead ends: 36224 [2018-12-09 16:23:41,807 INFO L226 Difference]: Without dead ends: 35180 [2018-12-09 16:23:41,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 16:23:41,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35180 states. [2018-12-09 16:23:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35180 to 29756. [2018-12-09 16:23:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29756 states. [2018-12-09 16:23:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29756 states to 29756 states and 124486 transitions. [2018-12-09 16:23:42,316 INFO L78 Accepts]: Start accepts. Automaton has 29756 states and 124486 transitions. Word has length 51 [2018-12-09 16:23:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:42,317 INFO L480 AbstractCegarLoop]: Abstraction has 29756 states and 124486 transitions. [2018-12-09 16:23:42,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 16:23:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 29756 states and 124486 transitions. [2018-12-09 16:23:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:23:42,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:42,339 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] [2018-12-09 16:23:42,339 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:42,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1275829881, now seen corresponding path program 1 times [2018-12-09 16:23:42,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:42,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:42,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:42,918 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 16:23:42,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:42,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 16:23:42,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:42,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 16:23:42,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 16:23:42,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:23:42,919 INFO L87 Difference]: Start difference. First operand 29756 states and 124486 transitions. Second operand 21 states. [2018-12-09 16:23:43,483 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2018-12-09 16:23:43,967 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2018-12-09 16:23:44,266 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2018-12-09 16:23:44,587 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-12-09 16:23:44,944 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-12-09 16:23:45,317 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-12-09 16:23:46,485 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-12-09 16:23:46,832 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-12-09 16:23:47,097 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-09 16:23:47,424 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-12-09 16:23:47,709 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-12-09 16:23:48,050 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-12-09 16:23:48,250 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-12-09 16:23:48,466 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-12-09 16:23:48,688 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-12-09 16:23:49,042 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2018-12-09 16:23:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:49,254 INFO L93 Difference]: Finished difference Result 37835 states and 157450 transitions. [2018-12-09 16:23:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 16:23:49,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-09 16:23:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:49,349 INFO L225 Difference]: With dead ends: 37835 [2018-12-09 16:23:49,349 INFO L226 Difference]: Without dead ends: 36917 [2018-12-09 16:23:49,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=374, Invalid=1348, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 16:23:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36917 states. [2018-12-09 16:23:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36917 to 25502. [2018-12-09 16:23:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25502 states. [2018-12-09 16:23:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25502 states to 25502 states and 105052 transitions. [2018-12-09 16:23:49,945 INFO L78 Accepts]: Start accepts. Automaton has 25502 states and 105052 transitions. Word has length 51 [2018-12-09 16:23:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:49,945 INFO L480 AbstractCegarLoop]: Abstraction has 25502 states and 105052 transitions. [2018-12-09 16:23:49,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 16:23:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 25502 states and 105052 transitions. [2018-12-09 16:23:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:23:49,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:49,964 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] [2018-12-09 16:23:49,964 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:49,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1589892095, now seen corresponding path program 2 times [2018-12-09 16:23:49,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:49,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:49,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:49,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:49,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:50,373 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-12-09 16:23:50,638 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-12-09 16:23:50,983 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2018-12-09 16:23:51,389 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-12-09 16:23:51,729 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-12-09 16:23:52,063 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-12-09 16:23:52,288 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-12-09 16:23:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:52,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:52,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 16:23:52,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:52,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 16:23:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 16:23:52,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:23:52,678 INFO L87 Difference]: Start difference. First operand 25502 states and 105052 transitions. Second operand 21 states. [2018-12-09 16:23:54,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:54,889 INFO L93 Difference]: Finished difference Result 38880 states and 159223 transitions. [2018-12-09 16:23:54,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 16:23:54,889 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-09 16:23:54,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:54,961 INFO L225 Difference]: With dead ends: 38880 [2018-12-09 16:23:54,961 INFO L226 Difference]: Without dead ends: 38574 [2018-12-09 16:23:54,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 16:23:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38574 states. [2018-12-09 16:23:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38574 to 20447. [2018-12-09 16:23:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20447 states. [2018-12-09 16:23:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20447 states to 20447 states and 83415 transitions. [2018-12-09 16:23:55,385 INFO L78 Accepts]: Start accepts. Automaton has 20447 states and 83415 transitions. Word has length 51 [2018-12-09 16:23:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:55,385 INFO L480 AbstractCegarLoop]: Abstraction has 20447 states and 83415 transitions. [2018-12-09 16:23:55,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 16:23:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 20447 states and 83415 transitions. [2018-12-09 16:23:55,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:23:55,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:55,399 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] [2018-12-09 16:23:55,399 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:55,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:55,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1569150769, now seen corresponding path program 1 times [2018-12-09 16:23:55,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:55,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:55,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:23:55,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:55,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:55,871 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 16:23:55,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:55,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 16:23:55,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:55,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 16:23:55,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 16:23:55,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:23:55,872 INFO L87 Difference]: Start difference. First operand 20447 states and 83415 transitions. Second operand 19 states. [2018-12-09 16:23:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:56,889 INFO L93 Difference]: Finished difference Result 25964 states and 104818 transitions. [2018-12-09 16:23:56,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 16:23:56,889 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-12-09 16:23:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:56,938 INFO L225 Difference]: With dead ends: 25964 [2018-12-09 16:23:56,938 INFO L226 Difference]: Without dead ends: 25595 [2018-12-09 16:23:56,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2018-12-09 16:23:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25595 states. [2018-12-09 16:23:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25595 to 20399. [2018-12-09 16:23:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20399 states. [2018-12-09 16:23:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20399 states to 20399 states and 83215 transitions. [2018-12-09 16:23:57,277 INFO L78 Accepts]: Start accepts. Automaton has 20399 states and 83215 transitions. Word has length 51 [2018-12-09 16:23:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:57,277 INFO L480 AbstractCegarLoop]: Abstraction has 20399 states and 83215 transitions. [2018-12-09 16:23:57,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 16:23:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 20399 states and 83215 transitions. [2018-12-09 16:23:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:23:57,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:57,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:23:57,291 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:57,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:57,291 INFO L82 PathProgramCache]: Analyzing trace with hash 514067265, now seen corresponding path program 2 times [2018-12-09 16:23:57,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:57,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:57,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:57,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:57,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:57,775 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 16:23:57,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:57,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 16:23:57,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:57,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 16:23:57,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 16:23:57,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:23:57,777 INFO L87 Difference]: Start difference. First operand 20399 states and 83215 transitions. Second operand 19 states. [2018-12-09 16:23:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:59,268 INFO L93 Difference]: Finished difference Result 27038 states and 108725 transitions. [2018-12-09 16:23:59,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 16:23:59,268 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-12-09 16:23:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:59,317 INFO L225 Difference]: With dead ends: 27038 [2018-12-09 16:23:59,317 INFO L226 Difference]: Without dead ends: 26669 [2018-12-09 16:23:59,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 16:23:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26669 states. [2018-12-09 16:23:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26669 to 20090. [2018-12-09 16:23:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20090 states. [2018-12-09 16:23:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20090 states to 20090 states and 82205 transitions. [2018-12-09 16:23:59,660 INFO L78 Accepts]: Start accepts. Automaton has 20090 states and 82205 transitions. Word has length 51 [2018-12-09 16:23:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:59,660 INFO L480 AbstractCegarLoop]: Abstraction has 20090 states and 82205 transitions. [2018-12-09 16:23:59,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 16:23:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 20090 states and 82205 transitions. [2018-12-09 16:23:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:23:59,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:59,674 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] [2018-12-09 16:23:59,674 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:23:59,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:59,674 INFO L82 PathProgramCache]: Analyzing trace with hash -292569965, now seen corresponding path program 1 times [2018-12-09 16:23:59,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:59,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:59,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:23:59,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:59,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:00,040 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 16:24:00,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:00,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-09 16:24:00,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:24:00,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 16:24:00,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 16:24:00,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-09 16:24:00,040 INFO L87 Difference]: Start difference. First operand 20090 states and 82205 transitions. Second operand 18 states. [2018-12-09 16:24:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:00,736 INFO L93 Difference]: Finished difference Result 26099 states and 105749 transitions. [2018-12-09 16:24:00,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 16:24:00,737 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-12-09 16:24:00,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:00,782 INFO L225 Difference]: With dead ends: 26099 [2018-12-09 16:24:00,782 INFO L226 Difference]: Without dead ends: 25550 [2018-12-09 16:24:00,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-12-09 16:24:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25550 states. [2018-12-09 16:24:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25550 to 20034. [2018-12-09 16:24:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20034 states. [2018-12-09 16:24:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20034 states to 20034 states and 81977 transitions. [2018-12-09 16:24:01,111 INFO L78 Accepts]: Start accepts. Automaton has 20034 states and 81977 transitions. Word has length 51 [2018-12-09 16:24:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:01,111 INFO L480 AbstractCegarLoop]: Abstraction has 20034 states and 81977 transitions. [2018-12-09 16:24:01,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 16:24:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 20034 states and 81977 transitions. [2018-12-09 16:24:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:24:01,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:01,125 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] [2018-12-09 16:24:01,125 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:24:01,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:01,125 INFO L82 PathProgramCache]: Analyzing trace with hash -774880281, now seen corresponding path program 2 times [2018-12-09 16:24:01,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:24:01,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:01,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:01,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:01,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:24:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:01,694 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 16:24:01,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:01,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 16:24:01,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:24:01,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 16:24:01,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 16:24:01,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:24:01,695 INFO L87 Difference]: Start difference. First operand 20034 states and 81977 transitions. Second operand 21 states. [2018-12-09 16:24:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:03,132 INFO L93 Difference]: Finished difference Result 24529 states and 99196 transitions. [2018-12-09 16:24:03,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 16:24:03,133 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-09 16:24:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:03,172 INFO L225 Difference]: With dead ends: 24529 [2018-12-09 16:24:03,172 INFO L226 Difference]: Without dead ends: 22702 [2018-12-09 16:24:03,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=382, Invalid=1340, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 16:24:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22702 states. [2018-12-09 16:24:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22702 to 17110. [2018-12-09 16:24:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17110 states. [2018-12-09 16:24:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17110 states to 17110 states and 69704 transitions. [2018-12-09 16:24:03,460 INFO L78 Accepts]: Start accepts. Automaton has 17110 states and 69704 transitions. Word has length 51 [2018-12-09 16:24:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:03,460 INFO L480 AbstractCegarLoop]: Abstraction has 17110 states and 69704 transitions. [2018-12-09 16:24:03,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 16:24:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 17110 states and 69704 transitions. [2018-12-09 16:24:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 16:24:03,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:03,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:24:03,472 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:24:03,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash -210797077, now seen corresponding path program 1 times [2018-12-09 16:24:03,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:24:03,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:03,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:24:03,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:03,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:24:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:24:03,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:03,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:24:03,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:24:03,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:24:03,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:24:03,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:24:03,525 INFO L87 Difference]: Start difference. First operand 17110 states and 69704 transitions. Second operand 7 states. [2018-12-09 16:24:03,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:03,726 INFO L93 Difference]: Finished difference Result 20102 states and 80003 transitions. [2018-12-09 16:24:03,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 16:24:03,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-09 16:24:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:03,759 INFO L225 Difference]: With dead ends: 20102 [2018-12-09 16:24:03,759 INFO L226 Difference]: Without dead ends: 19382 [2018-12-09 16:24:03,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-09 16:24:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19382 states. [2018-12-09 16:24:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19382 to 18962. [2018-12-09 16:24:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18962 states. [2018-12-09 16:24:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18962 states to 18962 states and 76406 transitions. [2018-12-09 16:24:04,033 INFO L78 Accepts]: Start accepts. Automaton has 18962 states and 76406 transitions. Word has length 52 [2018-12-09 16:24:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:04,033 INFO L480 AbstractCegarLoop]: Abstraction has 18962 states and 76406 transitions. [2018-12-09 16:24:04,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:24:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 18962 states and 76406 transitions. [2018-12-09 16:24:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 16:24:04,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:04,048 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 16:24:04,048 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:24:04,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:04,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1972668099, now seen corresponding path program 2 times [2018-12-09 16:24:04,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:24:04,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:04,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:04,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:04,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:24:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:04,607 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 16:24:04,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:04,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 16:24:04,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:24:04,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 16:24:04,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 16:24:04,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:24:04,608 INFO L87 Difference]: Start difference. First operand 18962 states and 76406 transitions. Second operand 21 states. [2018-12-09 16:24:05,836 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-12-09 16:24:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:06,292 INFO L93 Difference]: Finished difference Result 24590 states and 97599 transitions. [2018-12-09 16:24:06,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 16:24:06,292 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-12-09 16:24:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:06,331 INFO L225 Difference]: With dead ends: 24590 [2018-12-09 16:24:06,331 INFO L226 Difference]: Without dead ends: 22430 [2018-12-09 16:24:06,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=390, Invalid=1332, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 16:24:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22430 states. [2018-12-09 16:24:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22430 to 18290. [2018-12-09 16:24:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18290 states. [2018-12-09 16:24:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18290 states to 18290 states and 73678 transitions. [2018-12-09 16:24:06,617 INFO L78 Accepts]: Start accepts. Automaton has 18290 states and 73678 transitions. Word has length 52 [2018-12-09 16:24:06,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:06,617 INFO L480 AbstractCegarLoop]: Abstraction has 18290 states and 73678 transitions. [2018-12-09 16:24:06,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 16:24:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 18290 states and 73678 transitions. [2018-12-09 16:24:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 16:24:06,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:06,631 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 16:24:06,631 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:24:06,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1930062503, now seen corresponding path program 3 times [2018-12-09 16:24:06,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:24:06,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:06,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:24:06,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:06,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:24:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:24:06,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:06,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-09 16:24:06,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:24:06,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 16:24:06,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 16:24:06,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-12-09 16:24:06,961 INFO L87 Difference]: Start difference. First operand 18290 states and 73678 transitions. Second operand 18 states. [2018-12-09 16:24:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:07,394 INFO L93 Difference]: Finished difference Result 24227 states and 94267 transitions. [2018-12-09 16:24:07,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 16:24:07,394 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-12-09 16:24:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:07,432 INFO L225 Difference]: With dead ends: 24227 [2018-12-09 16:24:07,432 INFO L226 Difference]: Without dead ends: 23507 [2018-12-09 16:24:07,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-12-09 16:24:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23507 states. [2018-12-09 16:24:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23507 to 17551. [2018-12-09 16:24:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17551 states. [2018-12-09 16:24:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17551 states to 17551 states and 70727 transitions. [2018-12-09 16:24:07,713 INFO L78 Accepts]: Start accepts. Automaton has 17551 states and 70727 transitions. Word has length 52 [2018-12-09 16:24:07,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:07,714 INFO L480 AbstractCegarLoop]: Abstraction has 17551 states and 70727 transitions. [2018-12-09 16:24:07,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 16:24:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 17551 states and 70727 transitions. [2018-12-09 16:24:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 16:24:07,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:07,728 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 16:24:07,728 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:24:07,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:07,728 INFO L82 PathProgramCache]: Analyzing trace with hash 430172722, now seen corresponding path program 1 times [2018-12-09 16:24:07,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:24:07,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:07,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:24:07,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:07,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:24:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:08,314 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-12-09 16:24:08,567 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 16:24:08,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:08,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 16:24:08,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:24:08,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 16:24:08,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 16:24:08,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:24:08,568 INFO L87 Difference]: Start difference. First operand 17551 states and 70727 transitions. Second operand 21 states. [2018-12-09 16:24:08,903 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-12-09 16:24:09,275 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-12-09 16:24:09,729 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2018-12-09 16:24:10,258 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-12-09 16:24:10,944 WARN L180 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2018-12-09 16:24:11,560 WARN L180 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2018-12-09 16:24:12,048 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-12-09 16:24:12,305 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-12-09 16:24:12,523 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2018-12-09 16:24:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:13,512 INFO L93 Difference]: Finished difference Result 25327 states and 100129 transitions. [2018-12-09 16:24:13,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 16:24:13,513 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-12-09 16:24:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:13,555 INFO L225 Difference]: With dead ends: 25327 [2018-12-09 16:24:13,555 INFO L226 Difference]: Without dead ends: 25012 [2018-12-09 16:24:13,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=325, Invalid=1315, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 16:24:13,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25012 states. [2018-12-09 16:24:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25012 to 13402. [2018-12-09 16:24:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13402 states. [2018-12-09 16:24:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13402 states to 13402 states and 53709 transitions. [2018-12-09 16:24:13,818 INFO L78 Accepts]: Start accepts. Automaton has 13402 states and 53709 transitions. Word has length 53 [2018-12-09 16:24:13,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:13,818 INFO L480 AbstractCegarLoop]: Abstraction has 13402 states and 53709 transitions. [2018-12-09 16:24:13,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 16:24:13,818 INFO L276 IsEmpty]: Start isEmpty. Operand 13402 states and 53709 transitions. [2018-12-09 16:24:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 16:24:13,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:13,830 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] [2018-12-09 16:24:13,830 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:24:13,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:13,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1341438564, now seen corresponding path program 1 times [2018-12-09 16:24:13,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:24:13,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:13,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:13,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:13,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:24:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:14,531 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 16:24:14,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:14,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 16:24:14,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:24:14,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 16:24:14,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 16:24:14,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:24:14,532 INFO L87 Difference]: Start difference. First operand 13402 states and 53709 transitions. Second operand 21 states. [2018-12-09 16:24:14,982 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-12-09 16:24:15,255 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-12-09 16:24:15,604 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-12-09 16:24:15,937 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-12-09 16:24:17,603 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-09 16:24:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:18,443 INFO L93 Difference]: Finished difference Result 22774 states and 89010 transitions. [2018-12-09 16:24:18,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 16:24:18,444 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-12-09 16:24:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:18,498 INFO L225 Difference]: With dead ends: 22774 [2018-12-09 16:24:18,498 INFO L226 Difference]: Without dead ends: 22198 [2018-12-09 16:24:18,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 16:24:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22198 states. [2018-12-09 16:24:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22198 to 12634. [2018-12-09 16:24:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12634 states. [2018-12-09 16:24:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12634 states to 12634 states and 50125 transitions. [2018-12-09 16:24:18,735 INFO L78 Accepts]: Start accepts. Automaton has 12634 states and 50125 transitions. Word has length 54 [2018-12-09 16:24:18,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:18,735 INFO L480 AbstractCegarLoop]: Abstraction has 12634 states and 50125 transitions. [2018-12-09 16:24:18,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 16:24:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 12634 states and 50125 transitions. [2018-12-09 16:24:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 16:24:18,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:18,747 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] [2018-12-09 16:24:18,747 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:24:18,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:18,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1434717976, now seen corresponding path program 2 times [2018-12-09 16:24:18,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:24:18,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:18,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:18,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:18,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:24:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:19,338 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2018-12-09 16:24:19,782 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 16:24:19,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:19,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 16:24:19,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:24:19,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 16:24:19,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 16:24:19,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:24:19,783 INFO L87 Difference]: Start difference. First operand 12634 states and 50125 transitions. Second operand 21 states. [2018-12-09 16:24:21,155 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-12-09 16:24:21,672 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2018-12-09 16:24:22,234 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 16:24:22,582 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 16:24:23,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:23,625 INFO L93 Difference]: Finished difference Result 12034 states and 46239 transitions. [2018-12-09 16:24:23,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 16:24:23,626 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-12-09 16:24:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:23,658 INFO L225 Difference]: With dead ends: 12034 [2018-12-09 16:24:23,658 INFO L226 Difference]: Without dead ends: 11458 [2018-12-09 16:24:23,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=443, Invalid=1813, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 16:24:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2018-12-09 16:24:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 6913. [2018-12-09 16:24:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2018-12-09 16:24:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 28314 transitions. [2018-12-09 16:24:23,779 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 28314 transitions. Word has length 54 [2018-12-09 16:24:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:23,779 INFO L480 AbstractCegarLoop]: Abstraction has 6913 states and 28314 transitions. [2018-12-09 16:24:23,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 16:24:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 28314 transitions. [2018-12-09 16:24:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 16:24:23,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:23,788 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, 1, 1, 1, 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 16:24:23,788 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:24:23,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:23,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1240823866, now seen corresponding path program 1 times [2018-12-09 16:24:23,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:24:23,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:23,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:24:23,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:23,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:24:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:23,862 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 16:24:23,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:23,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 16:24:23,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:24:23,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:24:23,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:24:23,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:24:23,863 INFO L87 Difference]: Start difference. First operand 6913 states and 28314 transitions. Second operand 9 states. [2018-12-09 16:24:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:23,983 INFO L93 Difference]: Finished difference Result 6913 states and 28308 transitions. [2018-12-09 16:24:23,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 16:24:23,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-09 16:24:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:23,994 INFO L225 Difference]: With dead ends: 6913 [2018-12-09 16:24:23,994 INFO L226 Difference]: Without dead ends: 6868 [2018-12-09 16:24:23,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-12-09 16:24:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2018-12-09 16:24:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6868. [2018-12-09 16:24:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6868 states. [2018-12-09 16:24:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6868 states to 6868 states and 28122 transitions. [2018-12-09 16:24:24,090 INFO L78 Accepts]: Start accepts. Automaton has 6868 states and 28122 transitions. Word has length 87 [2018-12-09 16:24:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:24,091 INFO L480 AbstractCegarLoop]: Abstraction has 6868 states and 28122 transitions. [2018-12-09 16:24:24,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:24:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6868 states and 28122 transitions. [2018-12-09 16:24:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 16:24:24,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:24,100 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, 1, 1, 1, 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 16:24:24,100 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:24:24,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:24,100 INFO L82 PathProgramCache]: Analyzing trace with hash 941155209, now seen corresponding path program 1 times [2018-12-09 16:24:24,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:24:24,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:24,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:24,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:24,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:24:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:24,169 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 16:24:24,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:24,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 16:24:24,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:24:24,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:24:24,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:24:24,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:24:24,170 INFO L87 Difference]: Start difference. First operand 6868 states and 28122 transitions. Second operand 9 states. [2018-12-09 16:24:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:24,295 INFO L93 Difference]: Finished difference Result 6868 states and 28116 transitions. [2018-12-09 16:24:24,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 16:24:24,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-09 16:24:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:24,305 INFO L225 Difference]: With dead ends: 6868 [2018-12-09 16:24:24,305 INFO L226 Difference]: Without dead ends: 6670 [2018-12-09 16:24:24,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-12-09 16:24:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2018-12-09 16:24:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6670. [2018-12-09 16:24:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2018-12-09 16:24:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 27300 transitions. [2018-12-09 16:24:24,390 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 27300 transitions. Word has length 87 [2018-12-09 16:24:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:24,390 INFO L480 AbstractCegarLoop]: Abstraction has 6670 states and 27300 transitions. [2018-12-09 16:24:24,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:24:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 27300 transitions. [2018-12-09 16:24:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 16:24:24,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:24,398 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, 1, 1, 1, 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 16:24:24,399 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:24:24,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash 116030204, now seen corresponding path program 1 times [2018-12-09 16:24:24,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:24:24,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:24,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:24,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:24,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:24:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:24,510 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 16:24:24,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:24,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 16:24:24,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:24:24,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 16:24:24,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 16:24:24,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:24:24,510 INFO L87 Difference]: Start difference. First operand 6670 states and 27300 transitions. Second operand 10 states. [2018-12-09 16:24:24,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:24,714 INFO L93 Difference]: Finished difference Result 6670 states and 27264 transitions. [2018-12-09 16:24:24,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 16:24:24,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-12-09 16:24:24,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:24,724 INFO L225 Difference]: With dead ends: 6670 [2018-12-09 16:24:24,724 INFO L226 Difference]: Without dead ends: 6328 [2018-12-09 16:24:24,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-12-09 16:24:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6328 states. [2018-12-09 16:24:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6328 to 6328. [2018-12-09 16:24:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-12-09 16:24:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 25848 transitions. [2018-12-09 16:24:24,804 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 25848 transitions. Word has length 87 [2018-12-09 16:24:24,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:24,804 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 25848 transitions. [2018-12-09 16:24:24,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 16:24:24,804 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 25848 transitions. [2018-12-09 16:24:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 16:24:24,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:24,811 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, 1, 1, 1, 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 16:24:24,811 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:24:24,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:24,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1769800394, now seen corresponding path program 1 times [2018-12-09 16:24:24,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:24:24,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:24,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:24,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:24:24,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:24:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:24:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:24:24,877 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 16:24:24,936 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 16:24:24,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:24:24 BasicIcfg [2018-12-09 16:24:24,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:24:24,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:24:24,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:24:24,937 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:24:24,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:22:47" (3/4) ... [2018-12-09 16:24:24,940 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 16:24:24,993 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4e6d81da-3709-44fd-b384-5ee2b27a13e7/bin-2019/utaipan/witness.graphml [2018-12-09 16:24:24,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:24:24,993 INFO L168 Benchmark]: Toolchain (without parser) took 97957.30 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 952.4 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 584.2 MB. Max. memory is 11.5 GB. [2018-12-09 16:24:24,994 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:24:24,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -142.2 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-12-09 16:24:24,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:24:24,994 INFO L168 Benchmark]: Boogie Preprocessor took 15.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 16:24:24,994 INFO L168 Benchmark]: RCFGBuilder took 227.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2018-12-09 16:24:24,995 INFO L168 Benchmark]: TraceAbstraction took 97226.30 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-12-09 16:24:24,995 INFO L168 Benchmark]: Witness Printer took 55.60 ms. Allocated memory is still 4.6 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2018-12-09 16:24:24,996 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -142.2 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 227.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 97226.30 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 55.60 ms. Allocated memory is still 4.6 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1212]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1213] -1 char *v; VAL [v={0:0}] [L1246] -1 pthread_t t; VAL [v={0:0}] [L1247] FCALL, FORK -1 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1231] 0 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={0:0}] [L1232] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={0:0}] [L1216] 1 v = malloc(sizeof(char)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1217] 1 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1248] -1 \read(t) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1233] 0 \read(t1) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1233] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1234] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1221] 2 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1222] 2 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1235] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1236] FCALL, FORK 0 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1237] FCALL, FORK 0 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1221] 4 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1222] 4 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1238] 0 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1238] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1239] 0 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1221] 5 v[0] = 'X' VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1222] 5 return 0; VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1226] 3 v[0] = 'Y' VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1227] 3 return 0; VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1239] FCALL, JOIN 3 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1240] 0 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1240] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1241] 0 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1241] FCALL, JOIN 4 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, v={92:0}] [L1248] FCALL, JOIN 0 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, v={92:0}] [L1249] -1 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, v={92:0}] [L1212] COND TRUE -1 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, v={92:0}] [L1212] -1 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, v={92:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 166 locations, 1 error locations. UNSAFE Result, 97.0s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 57.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7720 SDtfs, 22631 SDslu, 50523 SDs, 0 SdLazy, 23138 SolverSat, 3034 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1207 GetRequests, 151 SyntacticMatches, 46 SemanticMatches, 1010 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6368 ImplicationChecksByTransitivity, 43.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47312occurred 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: 20.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 292546 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 2055 NumberOfCodeBlocks, 2055 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1929 ConstructedInterpolants, 0 QuantifiedInterpolants, 1799036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...