./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt_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_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/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 278d8bd7c1a97e577a985a40cd86e40d2394589b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 07:10:25,362 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:10:25,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:10:25,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:10:25,369 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:10:25,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:10:25,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:10:25,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:10:25,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:10:25,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:10:25,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:10:25,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:10:25,374 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:10:25,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:10:25,375 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:10:25,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:10:25,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:10:25,376 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:10:25,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:10:25,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:10:25,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:10:25,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:10:25,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:10:25,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:10:25,381 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:10:25,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:10:25,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:10:25,382 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:10:25,383 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:10:25,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:10:25,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:10:25,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:10:25,384 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:10:25,384 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:10:25,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:10:25,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:10:25,385 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 07:10:25,392 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:10:25,392 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:10:25,393 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 07:10:25,393 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 07:10:25,393 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 07:10:25,393 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 07:10:25,393 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 07:10:25,394 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 07:10:25,394 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 07:10:25,394 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 07:10:25,394 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 07:10:25,394 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 07:10:25,394 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 07:10:25,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:10:25,395 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 07:10:25,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:10:25,395 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 07:10:25,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:10:25,395 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 07:10:25,395 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 07:10:25,395 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 07:10:25,396 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 07:10:25,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:10:25,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 07:10:25,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:10:25,396 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:10:25,396 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 07:10:25,396 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 07:10:25,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:10:25,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:10:25,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 07:10:25,397 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 07:10:25,397 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 07:10:25,397 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 07:10:25,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 07:10:25,397 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 07:10:25,397 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_36b717cd-82d5-47ad-b828-ad5f294a0949/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 -> 278d8bd7c1a97e577a985a40cd86e40d2394589b [2018-12-02 07:10:25,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:10:25,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:10:25,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:10:25,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:10:25,429 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:10:25,429 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i [2018-12-02 07:10:25,467 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/data/19143207a/dcf29e8ba222468cad0ea025da79376c/FLAG91a08c688 [2018-12-02 07:10:25,918 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:10:25,918 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i [2018-12-02 07:10:25,928 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/data/19143207a/dcf29e8ba222468cad0ea025da79376c/FLAG91a08c688 [2018-12-02 07:10:25,937 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/data/19143207a/dcf29e8ba222468cad0ea025da79376c [2018-12-02 07:10:25,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:10:25,940 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:10:25,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:10:25,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:10:25,943 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:10:25,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:10:25" (1/1) ... [2018-12-02 07:10:25,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:25, skipping insertion in model container [2018-12-02 07:10:25,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:10:25" (1/1) ... [2018-12-02 07:10:25,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:10:25,978 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:10:26,174 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:10:26,183 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:10:26,251 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:10:26,282 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:10:26,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26 WrapperNode [2018-12-02 07:10:26,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:10:26,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:10:26,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:10:26,283 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:10:26,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26" (1/1) ... [2018-12-02 07:10:26,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26" (1/1) ... [2018-12-02 07:10:26,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:10:26,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:10:26,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:10:26,317 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:10:26,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26" (1/1) ... [2018-12-02 07:10:26,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26" (1/1) ... [2018-12-02 07:10:26,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26" (1/1) ... [2018-12-02 07:10:26,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26" (1/1) ... [2018-12-02 07:10:26,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26" (1/1) ... [2018-12-02 07:10:26,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26" (1/1) ... [2018-12-02 07:10:26,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26" (1/1) ... [2018-12-02 07:10:26,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:10:26,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:10:26,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:10:26,339 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:10:26,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:10:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 07:10:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 07:10:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 07:10:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 07:10:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 07:10:26,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 07:10:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 07:10:26,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 07:10:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 07:10:26,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 07:10:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 07:10:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:10:26,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:10:26,376 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 07:10:26,704 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:10:26,705 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 07:10:26,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:10:26 BoogieIcfgContainer [2018-12-02 07:10:26,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:10:26,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 07:10:26,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 07:10:26,708 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 07:10:26,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:10:25" (1/3) ... [2018-12-02 07:10:26,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4869397c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:10:26, skipping insertion in model container [2018-12-02 07:10:26,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:10:26" (2/3) ... [2018-12-02 07:10:26,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4869397c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:10:26, skipping insertion in model container [2018-12-02 07:10:26,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:10:26" (3/3) ... [2018-12-02 07:10:26,710 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt_false-unreach-call.i [2018-12-02 07:10:26,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,731 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,732 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,732 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,733 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,733 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,733 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,733 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,733 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,733 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,733 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,733 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,733 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,733 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,733 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,734 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,734 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,734 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,734 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,734 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,734 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,734 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,734 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,734 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,734 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,734 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,735 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,735 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,735 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,735 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,735 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,735 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,735 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,735 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,735 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,736 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,736 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,736 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,737 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,737 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,737 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,737 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 07:10:26,747 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 07:10:26,748 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 07:10:26,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 07:10:26,766 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 07:10:26,780 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 07:10:26,780 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 07:10:26,781 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 07:10:26,781 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:10:26,781 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:10:26,781 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 07:10:26,781 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:10:26,781 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 07:10:26,789 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154places, 191 transitions [2018-12-02 07:10:42,181 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128911 states. [2018-12-02 07:10:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 128911 states. [2018-12-02 07:10:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 07:10:42,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:10:42,190 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] [2018-12-02 07:10:42,191 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:10:42,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:10:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1836791117, now seen corresponding path program 1 times [2018-12-02 07:10:42,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:10:42,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:10:42,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:10:42,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:10:42,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:10:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:10:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:10:42,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:10:42,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:10:42,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:10:42,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:10:42,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:10:42,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:10:42,349 INFO L87 Difference]: Start difference. First operand 128911 states. Second operand 4 states. [2018-12-02 07:10:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:10:43,551 INFO L93 Difference]: Finished difference Result 233471 states and 1098323 transitions. [2018-12-02 07:10:43,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:10:43,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-02 07:10:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:10:45,995 INFO L225 Difference]: With dead ends: 233471 [2018-12-02 07:10:45,995 INFO L226 Difference]: Without dead ends: 203721 [2018-12-02 07:10:45,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:10:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203721 states. [2018-12-02 07:10:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203721 to 118891. [2018-12-02 07:10:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-02 07:10:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559774 transitions. [2018-12-02 07:10:49,320 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559774 transitions. Word has length 42 [2018-12-02 07:10:49,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:10:49,321 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559774 transitions. [2018-12-02 07:10:49,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:10:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559774 transitions. [2018-12-02 07:10:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 07:10:49,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:10:49,327 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-02 07:10:49,328 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:10:49,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:10:49,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1696589112, now seen corresponding path program 1 times [2018-12-02 07:10:49,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:10:49,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:10:49,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:10:49,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:10:49,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:10:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:10:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:10:49,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:10:49,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:10:49,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:10:49,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:10:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:10:49,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:10:49,384 INFO L87 Difference]: Start difference. First operand 118891 states and 559774 transitions. Second operand 3 states. [2018-12-02 07:10:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:10:50,271 INFO L93 Difference]: Finished difference Result 118891 states and 559659 transitions. [2018-12-02 07:10:50,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:10:50,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 07:10:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:10:50,606 INFO L225 Difference]: With dead ends: 118891 [2018-12-02 07:10:50,606 INFO L226 Difference]: Without dead ends: 118891 [2018-12-02 07:10:50,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:10:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118891 states. [2018-12-02 07:10:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118891 to 118891. [2018-12-02 07:10:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-02 07:10:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559659 transitions. [2018-12-02 07:10:53,152 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559659 transitions. Word has length 49 [2018-12-02 07:10:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:10:53,153 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559659 transitions. [2018-12-02 07:10:53,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:10:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559659 transitions. [2018-12-02 07:10:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 07:10:53,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:10:53,157 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-02 07:10:53,157 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:10:53,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:10:53,157 INFO L82 PathProgramCache]: Analyzing trace with hash 46221223, now seen corresponding path program 1 times [2018-12-02 07:10:53,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:10:53,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:10:53,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:10:53,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:10:53,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:10:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:10:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:10:53,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:10:53,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:10:53,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:10:53,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:10:53,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:10:53,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:10:53,220 INFO L87 Difference]: Start difference. First operand 118891 states and 559659 transitions. Second operand 5 states. [2018-12-02 07:10:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:10:55,163 INFO L93 Difference]: Finished difference Result 325271 states and 1470363 transitions. [2018-12-02 07:10:55,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:10:55,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-02 07:10:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:10:56,000 INFO L225 Difference]: With dead ends: 325271 [2018-12-02 07:10:56,000 INFO L226 Difference]: Without dead ends: 324271 [2018-12-02 07:10:56,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:10:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324271 states. [2018-12-02 07:11:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324271 to 186421. [2018-12-02 07:11:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186421 states. [2018-12-02 07:11:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186421 states to 186421 states and 842758 transitions. [2018-12-02 07:11:03,608 INFO L78 Accepts]: Start accepts. Automaton has 186421 states and 842758 transitions. Word has length 49 [2018-12-02 07:11:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:03,608 INFO L480 AbstractCegarLoop]: Abstraction has 186421 states and 842758 transitions. [2018-12-02 07:11:03,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:11:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 186421 states and 842758 transitions. [2018-12-02 07:11:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 07:11:03,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:03,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:03,613 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:03,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash 764594298, now seen corresponding path program 1 times [2018-12-02 07:11:03,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:03,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:03,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:03,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:03,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:11:03,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:03,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:11:03,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:11:03,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:11:03,655 INFO L87 Difference]: Start difference. First operand 186421 states and 842758 transitions. Second operand 4 states. [2018-12-02 07:11:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:04,346 INFO L93 Difference]: Finished difference Result 163597 states and 726959 transitions. [2018-12-02 07:11:04,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:11:04,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-02 07:11:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:04,734 INFO L225 Difference]: With dead ends: 163597 [2018-12-02 07:11:04,734 INFO L226 Difference]: Without dead ends: 160992 [2018-12-02 07:11:04,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160992 states. [2018-12-02 07:11:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160992 to 160992. [2018-12-02 07:11:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160992 states. [2018-12-02 07:11:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160992 states to 160992 states and 718277 transitions. [2018-12-02 07:11:08,025 INFO L78 Accepts]: Start accepts. Automaton has 160992 states and 718277 transitions. Word has length 50 [2018-12-02 07:11:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:08,025 INFO L480 AbstractCegarLoop]: Abstraction has 160992 states and 718277 transitions. [2018-12-02 07:11:08,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:11:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 160992 states and 718277 transitions. [2018-12-02 07:11:08,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 07:11:08,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:08,030 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-02 07:11:08,030 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:08,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:08,030 INFO L82 PathProgramCache]: Analyzing trace with hash 315183364, now seen corresponding path program 1 times [2018-12-02 07:11:08,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:08,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:08,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:08,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:08,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:08,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:08,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:11:08,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:08,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:11:08,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:11:08,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:08,079 INFO L87 Difference]: Start difference. First operand 160992 states and 718277 transitions. Second operand 5 states. [2018-12-02 07:11:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:09,925 INFO L93 Difference]: Finished difference Result 289848 states and 1287330 transitions. [2018-12-02 07:11:09,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:11:09,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-02 07:11:09,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:10,676 INFO L225 Difference]: With dead ends: 289848 [2018-12-02 07:11:10,676 INFO L226 Difference]: Without dead ends: 289008 [2018-12-02 07:11:10,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:11:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289008 states. [2018-12-02 07:11:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289008 to 169612. [2018-12-02 07:11:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169612 states. [2018-12-02 07:11:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169612 states to 169612 states and 753930 transitions. [2018-12-02 07:11:17,548 INFO L78 Accepts]: Start accepts. Automaton has 169612 states and 753930 transitions. Word has length 51 [2018-12-02 07:11:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:17,548 INFO L480 AbstractCegarLoop]: Abstraction has 169612 states and 753930 transitions. [2018-12-02 07:11:17,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:11:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 169612 states and 753930 transitions. [2018-12-02 07:11:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 07:11:17,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:17,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:17,569 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:17,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:17,569 INFO L82 PathProgramCache]: Analyzing trace with hash 336759908, now seen corresponding path program 1 times [2018-12-02 07:11:17,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:17,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:17,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:17,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:17,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:17,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:17,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:11:17,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:17,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:11:17,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:11:17,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:11:17,618 INFO L87 Difference]: Start difference. First operand 169612 states and 753930 transitions. Second operand 6 states. [2018-12-02 07:11:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:19,255 INFO L93 Difference]: Finished difference Result 292568 states and 1275883 transitions. [2018-12-02 07:11:19,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 07:11:19,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-02 07:11:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:20,438 INFO L225 Difference]: With dead ends: 292568 [2018-12-02 07:11:20,438 INFO L226 Difference]: Without dead ends: 291728 [2018-12-02 07:11:20,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-02 07:11:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291728 states. [2018-12-02 07:11:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291728 to 164644. [2018-12-02 07:11:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164644 states. [2018-12-02 07:11:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164644 states to 164644 states and 731936 transitions. [2018-12-02 07:11:26,827 INFO L78 Accepts]: Start accepts. Automaton has 164644 states and 731936 transitions. Word has length 58 [2018-12-02 07:11:26,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:26,827 INFO L480 AbstractCegarLoop]: Abstraction has 164644 states and 731936 transitions. [2018-12-02 07:11:26,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:11:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 164644 states and 731936 transitions. [2018-12-02 07:11:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 07:11:26,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:26,887 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] [2018-12-02 07:11:26,887 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:26,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:26,887 INFO L82 PathProgramCache]: Analyzing trace with hash 655738884, now seen corresponding path program 1 times [2018-12-02 07:11:26,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:26,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:26,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:26,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:26,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:26,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:26,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:11:26,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:26,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:11:26,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:11:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:11:26,940 INFO L87 Difference]: Start difference. First operand 164644 states and 731936 transitions. Second operand 4 states. [2018-12-02 07:11:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:28,530 INFO L93 Difference]: Finished difference Result 264420 states and 1161188 transitions. [2018-12-02 07:11:28,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:11:28,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 07:11:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:29,203 INFO L225 Difference]: With dead ends: 264420 [2018-12-02 07:11:29,203 INFO L226 Difference]: Without dead ends: 263060 [2018-12-02 07:11:29,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263060 states. [2018-12-02 07:11:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263060 to 220276. [2018-12-02 07:11:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220276 states. [2018-12-02 07:11:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220276 states to 220276 states and 976572 transitions. [2018-12-02 07:11:34,514 INFO L78 Accepts]: Start accepts. Automaton has 220276 states and 976572 transitions. Word has length 65 [2018-12-02 07:11:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:34,515 INFO L480 AbstractCegarLoop]: Abstraction has 220276 states and 976572 transitions. [2018-12-02 07:11:34,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:11:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 220276 states and 976572 transitions. [2018-12-02 07:11:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 07:11:34,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:34,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:34,599 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:34,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:34,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2009048581, now seen corresponding path program 1 times [2018-12-02 07:11:34,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:34,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:34,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:34,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:34,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:11:34,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:34,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:11:34,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:11:34,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:34,631 INFO L87 Difference]: Start difference. First operand 220276 states and 976572 transitions. Second operand 5 states. [2018-12-02 07:11:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:34,927 INFO L93 Difference]: Finished difference Result 78044 states and 314282 transitions. [2018-12-02 07:11:34,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:11:34,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 07:11:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:35,081 INFO L225 Difference]: With dead ends: 78044 [2018-12-02 07:11:35,081 INFO L226 Difference]: Without dead ends: 75732 [2018-12-02 07:11:35,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:11:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75732 states. [2018-12-02 07:11:35,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75732 to 75732. [2018-12-02 07:11:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75732 states. [2018-12-02 07:11:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75732 states to 75732 states and 305620 transitions. [2018-12-02 07:11:38,426 INFO L78 Accepts]: Start accepts. Automaton has 75732 states and 305620 transitions. Word has length 65 [2018-12-02 07:11:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:38,427 INFO L480 AbstractCegarLoop]: Abstraction has 75732 states and 305620 transitions. [2018-12-02 07:11:38,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:11:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 75732 states and 305620 transitions. [2018-12-02 07:11:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 07:11:38,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:38,472 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:38,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:38,472 INFO L82 PathProgramCache]: Analyzing trace with hash 493391520, now seen corresponding path program 1 times [2018-12-02 07:11:38,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:38,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:38,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:38,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:38,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:38,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:38,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:11:38,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:38,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:11:38,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:11:38,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:11:38,519 INFO L87 Difference]: Start difference. First operand 75732 states and 305620 transitions. Second operand 4 states. [2018-12-02 07:11:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:39,011 INFO L93 Difference]: Finished difference Result 105528 states and 420009 transitions. [2018-12-02 07:11:39,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:11:39,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 07:11:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:39,232 INFO L225 Difference]: With dead ends: 105528 [2018-12-02 07:11:39,233 INFO L226 Difference]: Without dead ends: 105528 [2018-12-02 07:11:39,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105528 states. [2018-12-02 07:11:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105528 to 81080. [2018-12-02 07:11:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81080 states. [2018-12-02 07:11:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81080 states to 81080 states and 325641 transitions. [2018-12-02 07:11:40,611 INFO L78 Accepts]: Start accepts. Automaton has 81080 states and 325641 transitions. Word has length 78 [2018-12-02 07:11:40,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:40,611 INFO L480 AbstractCegarLoop]: Abstraction has 81080 states and 325641 transitions. [2018-12-02 07:11:40,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:11:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 81080 states and 325641 transitions. [2018-12-02 07:11:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 07:11:40,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:40,666 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] [2018-12-02 07:11:40,666 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:40,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:40,666 INFO L82 PathProgramCache]: Analyzing trace with hash -191355072, now seen corresponding path program 1 times [2018-12-02 07:11:40,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:40,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:40,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:40,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:40,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:40,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:40,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:11:40,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:40,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:11:40,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:11:40,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:11:40,704 INFO L87 Difference]: Start difference. First operand 81080 states and 325641 transitions. Second operand 4 states. [2018-12-02 07:11:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:41,451 INFO L93 Difference]: Finished difference Result 113667 states and 450915 transitions. [2018-12-02 07:11:41,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:11:41,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 07:11:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:41,683 INFO L225 Difference]: With dead ends: 113667 [2018-12-02 07:11:41,683 INFO L226 Difference]: Without dead ends: 113667 [2018-12-02 07:11:41,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:41,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113667 states. [2018-12-02 07:11:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113667 to 102372. [2018-12-02 07:11:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102372 states. [2018-12-02 07:11:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102372 states to 102372 states and 408718 transitions. [2018-12-02 07:11:43,419 INFO L78 Accepts]: Start accepts. Automaton has 102372 states and 408718 transitions. Word has length 78 [2018-12-02 07:11:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:43,419 INFO L480 AbstractCegarLoop]: Abstraction has 102372 states and 408718 transitions. [2018-12-02 07:11:43,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:11:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand 102372 states and 408718 transitions. [2018-12-02 07:11:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 07:11:43,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:43,493 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] [2018-12-02 07:11:43,493 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:43,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:43,493 INFO L82 PathProgramCache]: Analyzing trace with hash 159444865, now seen corresponding path program 1 times [2018-12-02 07:11:43,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:43,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:43,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:43,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:43,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:43,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:43,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 07:11:43,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:43,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 07:11:43,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 07:11:43,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:11:43,599 INFO L87 Difference]: Start difference. First operand 102372 states and 408718 transitions. Second operand 8 states. [2018-12-02 07:11:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:44,952 INFO L93 Difference]: Finished difference Result 155234 states and 603182 transitions. [2018-12-02 07:11:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 07:11:44,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-02 07:11:44,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:45,262 INFO L225 Difference]: With dead ends: 155234 [2018-12-02 07:11:45,262 INFO L226 Difference]: Without dead ends: 154210 [2018-12-02 07:11:45,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 07:11:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154210 states. [2018-12-02 07:11:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154210 to 113269. [2018-12-02 07:11:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113269 states. [2018-12-02 07:11:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113269 states to 113269 states and 449340 transitions. [2018-12-02 07:11:47,346 INFO L78 Accepts]: Start accepts. Automaton has 113269 states and 449340 transitions. Word has length 78 [2018-12-02 07:11:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:47,346 INFO L480 AbstractCegarLoop]: Abstraction has 113269 states and 449340 transitions. [2018-12-02 07:11:47,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 07:11:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 113269 states and 449340 transitions. [2018-12-02 07:11:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 07:11:47,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:47,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:47,429 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:47,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:47,429 INFO L82 PathProgramCache]: Analyzing trace with hash -133958142, now seen corresponding path program 1 times [2018-12-02 07:11:47,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:47,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:47,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:47,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:47,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:47,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-02 07:11:47,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:47,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:11:47,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:47,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:11:47,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:11:47,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:11:47,518 INFO L87 Difference]: Start difference. First operand 113269 states and 449340 transitions. Second operand 6 states. [2018-12-02 07:11:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:48,138 INFO L93 Difference]: Finished difference Result 124463 states and 488873 transitions. [2018-12-02 07:11:48,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:11:48,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 07:11:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:48,397 INFO L225 Difference]: With dead ends: 124463 [2018-12-02 07:11:48,397 INFO L226 Difference]: Without dead ends: 124463 [2018-12-02 07:11:48,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:11:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124463 states. [2018-12-02 07:11:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124463 to 116556. [2018-12-02 07:11:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116556 states. [2018-12-02 07:11:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116556 states to 116556 states and 460918 transitions. [2018-12-02 07:11:50,279 INFO L78 Accepts]: Start accepts. Automaton has 116556 states and 460918 transitions. Word has length 78 [2018-12-02 07:11:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:50,279 INFO L480 AbstractCegarLoop]: Abstraction has 116556 states and 460918 transitions. [2018-12-02 07:11:50,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:11:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 116556 states and 460918 transitions. [2018-12-02 07:11:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 07:11:50,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:50,369 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] [2018-12-02 07:11:50,369 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:50,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:50,369 INFO L82 PathProgramCache]: Analyzing trace with hash 827655875, now seen corresponding path program 1 times [2018-12-02 07:11:50,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:50,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:50,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:50,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:50,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:11:50,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:50,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:11:50,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:11:50,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:11:50,412 INFO L87 Difference]: Start difference. First operand 116556 states and 460918 transitions. Second operand 6 states. [2018-12-02 07:11:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:50,525 INFO L93 Difference]: Finished difference Result 20396 states and 68134 transitions. [2018-12-02 07:11:50,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:11:50,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 07:11:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:50,547 INFO L225 Difference]: With dead ends: 20396 [2018-12-02 07:11:50,548 INFO L226 Difference]: Without dead ends: 17062 [2018-12-02 07:11:50,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:11:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17062 states. [2018-12-02 07:11:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17062 to 15577. [2018-12-02 07:11:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15577 states. [2018-12-02 07:11:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15577 states to 15577 states and 52276 transitions. [2018-12-02 07:11:50,716 INFO L78 Accepts]: Start accepts. Automaton has 15577 states and 52276 transitions. Word has length 78 [2018-12-02 07:11:50,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:50,716 INFO L480 AbstractCegarLoop]: Abstraction has 15577 states and 52276 transitions. [2018-12-02 07:11:50,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:11:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 15577 states and 52276 transitions. [2018-12-02 07:11:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 07:11:50,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:50,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:50,730 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:50,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:50,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2014372351, now seen corresponding path program 1 times [2018-12-02 07:11:50,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:50,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:50,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:50,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:50,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:50,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:50,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:11:50,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:50,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:11:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:11:50,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:50,789 INFO L87 Difference]: Start difference. First operand 15577 states and 52276 transitions. Second operand 5 states. [2018-12-02 07:11:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:50,926 INFO L93 Difference]: Finished difference Result 17227 states and 57291 transitions. [2018-12-02 07:11:50,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:11:50,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-02 07:11:50,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:50,946 INFO L225 Difference]: With dead ends: 17227 [2018-12-02 07:11:50,946 INFO L226 Difference]: Without dead ends: 17227 [2018-12-02 07:11:50,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17227 states. [2018-12-02 07:11:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17227 to 15767. [2018-12-02 07:11:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15767 states. [2018-12-02 07:11:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15767 states to 15767 states and 52948 transitions. [2018-12-02 07:11:51,126 INFO L78 Accepts]: Start accepts. Automaton has 15767 states and 52948 transitions. Word has length 97 [2018-12-02 07:11:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:51,126 INFO L480 AbstractCegarLoop]: Abstraction has 15767 states and 52948 transitions. [2018-12-02 07:11:51,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:11:51,126 INFO L276 IsEmpty]: Start isEmpty. Operand 15767 states and 52948 transitions. [2018-12-02 07:11:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 07:11:51,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:51,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:51,140 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:51,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:51,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1097247648, now seen corresponding path program 1 times [2018-12-02 07:11:51,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:51,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:51,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:51,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:51,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:11:51,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:51,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:11:51,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:11:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:11:51,183 INFO L87 Difference]: Start difference. First operand 15767 states and 52948 transitions. Second operand 6 states. [2018-12-02 07:11:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:51,476 INFO L93 Difference]: Finished difference Result 18487 states and 61234 transitions. [2018-12-02 07:11:51,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:11:51,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-02 07:11:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:51,496 INFO L225 Difference]: With dead ends: 18487 [2018-12-02 07:11:51,496 INFO L226 Difference]: Without dead ends: 18127 [2018-12-02 07:11:51,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:11:51,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2018-12-02 07:11:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17597. [2018-12-02 07:11:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17597 states. [2018-12-02 07:11:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17597 states to 17597 states and 58832 transitions. [2018-12-02 07:11:51,679 INFO L78 Accepts]: Start accepts. Automaton has 17597 states and 58832 transitions. Word has length 97 [2018-12-02 07:11:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:51,679 INFO L480 AbstractCegarLoop]: Abstraction has 17597 states and 58832 transitions. [2018-12-02 07:11:51,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:11:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 17597 states and 58832 transitions. [2018-12-02 07:11:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 07:11:51,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:51,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:51,696 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:51,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:51,696 INFO L82 PathProgramCache]: Analyzing trace with hash -800534339, now seen corresponding path program 2 times [2018-12-02 07:11:51,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:51,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:51,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:51,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:51,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:51,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:51,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:11:51,728 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:51,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:11:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:11:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:51,729 INFO L87 Difference]: Start difference. First operand 17597 states and 58832 transitions. Second operand 5 states. [2018-12-02 07:11:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:51,878 INFO L93 Difference]: Finished difference Result 23304 states and 76607 transitions. [2018-12-02 07:11:51,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:11:51,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-02 07:11:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:51,903 INFO L225 Difference]: With dead ends: 23304 [2018-12-02 07:11:51,903 INFO L226 Difference]: Without dead ends: 23144 [2018-12-02 07:11:51,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:11:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23144 states. [2018-12-02 07:11:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23144 to 19330. [2018-12-02 07:11:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19330 states. [2018-12-02 07:11:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 64347 transitions. [2018-12-02 07:11:52,118 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 64347 transitions. Word has length 97 [2018-12-02 07:11:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:52,118 INFO L480 AbstractCegarLoop]: Abstraction has 19330 states and 64347 transitions. [2018-12-02 07:11:52,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:11:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 64347 transitions. [2018-12-02 07:11:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 07:11:52,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:52,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:52,135 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:52,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:52,135 INFO L82 PathProgramCache]: Analyzing trace with hash -124487781, now seen corresponding path program 3 times [2018-12-02 07:11:52,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:52,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:52,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:11:52,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:52,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:52,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:52,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 07:11:52,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:52,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:11:52,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:11:52,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:11:52,190 INFO L87 Difference]: Start difference. First operand 19330 states and 64347 transitions. Second operand 7 states. [2018-12-02 07:11:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:52,463 INFO L93 Difference]: Finished difference Result 23210 states and 76033 transitions. [2018-12-02 07:11:52,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 07:11:52,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-02 07:11:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:52,489 INFO L225 Difference]: With dead ends: 23210 [2018-12-02 07:11:52,489 INFO L226 Difference]: Without dead ends: 22835 [2018-12-02 07:11:52,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:11:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22835 states. [2018-12-02 07:11:52,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22835 to 19315. [2018-12-02 07:11:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19315 states. [2018-12-02 07:11:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19315 states to 19315 states and 64230 transitions. [2018-12-02 07:11:52,698 INFO L78 Accepts]: Start accepts. Automaton has 19315 states and 64230 transitions. Word has length 97 [2018-12-02 07:11:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:52,698 INFO L480 AbstractCegarLoop]: Abstraction has 19315 states and 64230 transitions. [2018-12-02 07:11:52,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:11:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 19315 states and 64230 transitions. [2018-12-02 07:11:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 07:11:52,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:52,714 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:52,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:52,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2066828671, now seen corresponding path program 1 times [2018-12-02 07:11:52,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:52,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:52,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:11:52,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:52,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:52,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:52,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:11:52,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:52,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:11:52,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:11:52,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:11:52,772 INFO L87 Difference]: Start difference. First operand 19315 states and 64230 transitions. Second operand 6 states. [2018-12-02 07:11:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:52,935 INFO L93 Difference]: Finished difference Result 22820 states and 73489 transitions. [2018-12-02 07:11:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 07:11:52,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-02 07:11:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:52,959 INFO L225 Difference]: With dead ends: 22820 [2018-12-02 07:11:52,959 INFO L226 Difference]: Without dead ends: 22745 [2018-12-02 07:11:52,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:11:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22745 states. [2018-12-02 07:11:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22745 to 20185. [2018-12-02 07:11:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20185 states. [2018-12-02 07:11:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20185 states to 20185 states and 66021 transitions. [2018-12-02 07:11:53,169 INFO L78 Accepts]: Start accepts. Automaton has 20185 states and 66021 transitions. Word has length 97 [2018-12-02 07:11:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:53,169 INFO L480 AbstractCegarLoop]: Abstraction has 20185 states and 66021 transitions. [2018-12-02 07:11:53,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:11:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 20185 states and 66021 transitions. [2018-12-02 07:11:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 07:11:53,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:53,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:53,185 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:53,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:53,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1042134750, now seen corresponding path program 1 times [2018-12-02 07:11:53,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:53,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:53,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:53,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:53,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:11:53,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:53,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:11:53,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:11:53,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:53,224 INFO L87 Difference]: Start difference. First operand 20185 states and 66021 transitions. Second operand 5 states. [2018-12-02 07:11:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:53,432 INFO L93 Difference]: Finished difference Result 25977 states and 83364 transitions. [2018-12-02 07:11:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:11:53,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-02 07:11:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:53,457 INFO L225 Difference]: With dead ends: 25977 [2018-12-02 07:11:53,458 INFO L226 Difference]: Without dead ends: 25442 [2018-12-02 07:11:53,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:11:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25442 states. [2018-12-02 07:11:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25442 to 20955. [2018-12-02 07:11:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20955 states. [2018-12-02 07:11:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20955 states to 20955 states and 68022 transitions. [2018-12-02 07:11:53,678 INFO L78 Accepts]: Start accepts. Automaton has 20955 states and 68022 transitions. Word has length 97 [2018-12-02 07:11:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:53,678 INFO L480 AbstractCegarLoop]: Abstraction has 20955 states and 68022 transitions. [2018-12-02 07:11:53,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:11:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 20955 states and 68022 transitions. [2018-12-02 07:11:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 07:11:53,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:53,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:53,695 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:53,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:53,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2038420724, now seen corresponding path program 1 times [2018-12-02 07:11:53,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:53,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:53,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:53,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:53,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:53,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:53,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 07:11:53,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:53,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 07:11:53,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 07:11:53,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:11:53,753 INFO L87 Difference]: Start difference. First operand 20955 states and 68022 transitions. Second operand 9 states. [2018-12-02 07:11:54,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:54,413 INFO L93 Difference]: Finished difference Result 35170 states and 112670 transitions. [2018-12-02 07:11:54,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 07:11:54,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-02 07:11:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:54,454 INFO L225 Difference]: With dead ends: 35170 [2018-12-02 07:11:54,454 INFO L226 Difference]: Without dead ends: 35042 [2018-12-02 07:11:54,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-02 07:11:54,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35042 states. [2018-12-02 07:11:54,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35042 to 23768. [2018-12-02 07:11:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23768 states. [2018-12-02 07:11:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23768 states to 23768 states and 77120 transitions. [2018-12-02 07:11:54,758 INFO L78 Accepts]: Start accepts. Automaton has 23768 states and 77120 transitions. Word has length 99 [2018-12-02 07:11:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:54,759 INFO L480 AbstractCegarLoop]: Abstraction has 23768 states and 77120 transitions. [2018-12-02 07:11:54,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 07:11:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 23768 states and 77120 transitions. [2018-12-02 07:11:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 07:11:54,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:54,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:54,781 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:54,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:54,782 INFO L82 PathProgramCache]: Analyzing trace with hash -793656243, now seen corresponding path program 1 times [2018-12-02 07:11:54,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:54,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:54,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:54,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:54,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:54,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:54,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 07:11:54,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:54,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:11:54,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:11:54,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:11:54,856 INFO L87 Difference]: Start difference. First operand 23768 states and 77120 transitions. Second operand 7 states. [2018-12-02 07:11:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:55,298 INFO L93 Difference]: Finished difference Result 37316 states and 120409 transitions. [2018-12-02 07:11:55,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 07:11:55,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 07:11:55,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:55,338 INFO L225 Difference]: With dead ends: 37316 [2018-12-02 07:11:55,338 INFO L226 Difference]: Without dead ends: 36421 [2018-12-02 07:11:55,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 07:11:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36421 states. [2018-12-02 07:11:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36421 to 23258. [2018-12-02 07:11:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23258 states. [2018-12-02 07:11:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23258 states to 23258 states and 75202 transitions. [2018-12-02 07:11:55,645 INFO L78 Accepts]: Start accepts. Automaton has 23258 states and 75202 transitions. Word has length 99 [2018-12-02 07:11:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:55,645 INFO L480 AbstractCegarLoop]: Abstraction has 23258 states and 75202 transitions. [2018-12-02 07:11:55,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:11:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 23258 states and 75202 transitions. [2018-12-02 07:11:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 07:11:55,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:55,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:55,666 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:55,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1963977170, now seen corresponding path program 1 times [2018-12-02 07:11:55,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:55,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:55,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:55,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:55,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:11:55,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:55,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:11:55,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:11:55,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:11:55,729 INFO L87 Difference]: Start difference. First operand 23258 states and 75202 transitions. Second operand 6 states. [2018-12-02 07:11:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:55,856 INFO L93 Difference]: Finished difference Result 18999 states and 61501 transitions. [2018-12-02 07:11:55,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:11:55,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 07:11:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:55,878 INFO L225 Difference]: With dead ends: 18999 [2018-12-02 07:11:55,878 INFO L226 Difference]: Without dead ends: 18999 [2018-12-02 07:11:55,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:11:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18999 states. [2018-12-02 07:11:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18999 to 17499. [2018-12-02 07:11:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17499 states. [2018-12-02 07:11:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17499 states to 17499 states and 57066 transitions. [2018-12-02 07:11:56,117 INFO L78 Accepts]: Start accepts. Automaton has 17499 states and 57066 transitions. Word has length 99 [2018-12-02 07:11:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:56,117 INFO L480 AbstractCegarLoop]: Abstraction has 17499 states and 57066 transitions. [2018-12-02 07:11:56,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:11:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 17499 states and 57066 transitions. [2018-12-02 07:11:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 07:11:56,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:56,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:56,131 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:56,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash -456422671, now seen corresponding path program 1 times [2018-12-02 07:11:56,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:56,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:56,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:56,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:56,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:56,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:56,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 07:11:56,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:56,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:11:56,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:11:56,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:11:56,180 INFO L87 Difference]: Start difference. First operand 17499 states and 57066 transitions. Second operand 7 states. [2018-12-02 07:11:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:56,454 INFO L93 Difference]: Finished difference Result 19038 states and 61795 transitions. [2018-12-02 07:11:56,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:11:56,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 07:11:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:56,475 INFO L225 Difference]: With dead ends: 19038 [2018-12-02 07:11:56,475 INFO L226 Difference]: Without dead ends: 19038 [2018-12-02 07:11:56,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:11:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19038 states. [2018-12-02 07:11:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19038 to 17409. [2018-12-02 07:11:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17409 states. [2018-12-02 07:11:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17409 states to 17409 states and 56814 transitions. [2018-12-02 07:11:56,658 INFO L78 Accepts]: Start accepts. Automaton has 17409 states and 56814 transitions. Word has length 99 [2018-12-02 07:11:56,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:56,658 INFO L480 AbstractCegarLoop]: Abstraction has 17409 states and 56814 transitions. [2018-12-02 07:11:56,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:11:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 17409 states and 56814 transitions. [2018-12-02 07:11:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 07:11:56,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:56,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:56,674 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:56,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:56,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1639769968, now seen corresponding path program 1 times [2018-12-02 07:11:56,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:56,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:56,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:56,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:56,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 07:11:56,756 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:56,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 07:11:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 07:11:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:11:56,757 INFO L87 Difference]: Start difference. First operand 17409 states and 56814 transitions. Second operand 8 states. [2018-12-02 07:11:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:57,021 INFO L93 Difference]: Finished difference Result 22228 states and 71934 transitions. [2018-12-02 07:11:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 07:11:57,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-02 07:11:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:57,045 INFO L225 Difference]: With dead ends: 22228 [2018-12-02 07:11:57,045 INFO L226 Difference]: Without dead ends: 22100 [2018-12-02 07:11:57,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:11:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22100 states. [2018-12-02 07:11:57,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22100 to 17738. [2018-12-02 07:11:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17738 states. [2018-12-02 07:11:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17738 states to 17738 states and 57613 transitions. [2018-12-02 07:11:57,259 INFO L78 Accepts]: Start accepts. Automaton has 17738 states and 57613 transitions. Word has length 99 [2018-12-02 07:11:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:57,259 INFO L480 AbstractCegarLoop]: Abstraction has 17738 states and 57613 transitions. [2018-12-02 07:11:57,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 07:11:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 17738 states and 57613 transitions. [2018-12-02 07:11:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 07:11:57,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:57,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:57,276 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:57,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash -678155951, now seen corresponding path program 1 times [2018-12-02 07:11:57,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:57,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:57,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:57,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:57,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:57,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:57,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 07:11:57,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:57,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:11:57,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:11:57,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:11:57,330 INFO L87 Difference]: Start difference. First operand 17738 states and 57613 transitions. Second operand 7 states. [2018-12-02 07:11:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:57,576 INFO L93 Difference]: Finished difference Result 23099 states and 74558 transitions. [2018-12-02 07:11:57,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:11:57,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 07:11:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:57,600 INFO L225 Difference]: With dead ends: 23099 [2018-12-02 07:11:57,600 INFO L226 Difference]: Without dead ends: 23099 [2018-12-02 07:11:57,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 07:11:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23099 states. [2018-12-02 07:11:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23099 to 19145. [2018-12-02 07:11:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19145 states. [2018-12-02 07:11:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19145 states to 19145 states and 62246 transitions. [2018-12-02 07:11:57,802 INFO L78 Accepts]: Start accepts. Automaton has 19145 states and 62246 transitions. Word has length 99 [2018-12-02 07:11:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:57,802 INFO L480 AbstractCegarLoop]: Abstraction has 19145 states and 62246 transitions. [2018-12-02 07:11:57,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:11:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 19145 states and 62246 transitions. [2018-12-02 07:11:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 07:11:57,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:57,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:57,817 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:57,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:57,818 INFO L82 PathProgramCache]: Analyzing trace with hash 566608530, now seen corresponding path program 1 times [2018-12-02 07:11:57,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:57,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:57,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:57,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:57,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:11:57,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:57,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:11:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:11:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:57,873 INFO L87 Difference]: Start difference. First operand 19145 states and 62246 transitions. Second operand 5 states. [2018-12-02 07:11:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:57,958 INFO L93 Difference]: Finished difference Result 28269 states and 93441 transitions. [2018-12-02 07:11:57,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:11:57,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-02 07:11:57,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:57,993 INFO L225 Difference]: With dead ends: 28269 [2018-12-02 07:11:57,993 INFO L226 Difference]: Without dead ends: 28269 [2018-12-02 07:11:57,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:11:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28269 states. [2018-12-02 07:11:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28269 to 17378. [2018-12-02 07:11:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17378 states. [2018-12-02 07:11:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17378 states to 17378 states and 56135 transitions. [2018-12-02 07:11:58,217 INFO L78 Accepts]: Start accepts. Automaton has 17378 states and 56135 transitions. Word has length 99 [2018-12-02 07:11:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:58,217 INFO L480 AbstractCegarLoop]: Abstraction has 17378 states and 56135 transitions. [2018-12-02 07:11:58,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:11:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 17378 states and 56135 transitions. [2018-12-02 07:11:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 07:11:58,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:58,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:58,232 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:58,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:58,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1047324946, now seen corresponding path program 1 times [2018-12-02 07:11:58,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:58,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:58,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:58,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:58,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:58,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:58,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:11:58,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:58,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:11:58,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:11:58,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:11:58,284 INFO L87 Difference]: Start difference. First operand 17378 states and 56135 transitions. Second operand 6 states. [2018-12-02 07:11:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:58,413 INFO L93 Difference]: Finished difference Result 15906 states and 50519 transitions. [2018-12-02 07:11:58,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:11:58,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 07:11:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:58,429 INFO L225 Difference]: With dead ends: 15906 [2018-12-02 07:11:58,430 INFO L226 Difference]: Without dead ends: 15906 [2018-12-02 07:11:58,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:11:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15906 states. [2018-12-02 07:11:58,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15906 to 12495. [2018-12-02 07:11:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12495 states. [2018-12-02 07:11:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12495 states to 12495 states and 40503 transitions. [2018-12-02 07:11:58,600 INFO L78 Accepts]: Start accepts. Automaton has 12495 states and 40503 transitions. Word has length 99 [2018-12-02 07:11:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:58,600 INFO L480 AbstractCegarLoop]: Abstraction has 12495 states and 40503 transitions. [2018-12-02 07:11:58,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:11:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 12495 states and 40503 transitions. [2018-12-02 07:11:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 07:11:58,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:58,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:58,610 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:58,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:58,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1543607272, now seen corresponding path program 1 times [2018-12-02 07:11:58,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:58,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:58,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:58,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:58,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:58,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:58,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:11:58,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:58,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:11:58,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:11:58,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:11:58,664 INFO L87 Difference]: Start difference. First operand 12495 states and 40503 transitions. Second operand 5 states. [2018-12-02 07:11:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:58,811 INFO L93 Difference]: Finished difference Result 13903 states and 45015 transitions. [2018-12-02 07:11:58,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:11:58,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-02 07:11:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:58,827 INFO L225 Difference]: With dead ends: 13903 [2018-12-02 07:11:58,827 INFO L226 Difference]: Without dead ends: 13775 [2018-12-02 07:11:58,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:11:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13775 states. [2018-12-02 07:11:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13775 to 11719. [2018-12-02 07:11:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11719 states. [2018-12-02 07:11:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11719 states to 11719 states and 38008 transitions. [2018-12-02 07:11:58,953 INFO L78 Accepts]: Start accepts. Automaton has 11719 states and 38008 transitions. Word has length 101 [2018-12-02 07:11:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:58,954 INFO L480 AbstractCegarLoop]: Abstraction has 11719 states and 38008 transitions. [2018-12-02 07:11:58,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:11:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 11719 states and 38008 transitions. [2018-12-02 07:11:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 07:11:58,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:58,964 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:58,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:58,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1506595543, now seen corresponding path program 1 times [2018-12-02 07:11:58,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:58,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:58,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:58,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:58,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:59,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:59,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 07:11:59,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:59,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:11:59,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:11:59,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:11:59,030 INFO L87 Difference]: Start difference. First operand 11719 states and 38008 transitions. Second operand 7 states. [2018-12-02 07:11:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:59,221 INFO L93 Difference]: Finished difference Result 22183 states and 72336 transitions. [2018-12-02 07:11:59,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:11:59,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-02 07:11:59,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:59,233 INFO L225 Difference]: With dead ends: 22183 [2018-12-02 07:11:59,233 INFO L226 Difference]: Without dead ends: 11319 [2018-12-02 07:11:59,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:11:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11319 states. [2018-12-02 07:11:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11319 to 11059. [2018-12-02 07:11:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11059 states. [2018-12-02 07:11:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11059 states to 11059 states and 36088 transitions. [2018-12-02 07:11:59,340 INFO L78 Accepts]: Start accepts. Automaton has 11059 states and 36088 transitions. Word has length 101 [2018-12-02 07:11:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:59,340 INFO L480 AbstractCegarLoop]: Abstraction has 11059 states and 36088 transitions. [2018-12-02 07:11:59,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:11:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 11059 states and 36088 transitions. [2018-12-02 07:11:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 07:11:59,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:59,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:59,350 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:59,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:59,350 INFO L82 PathProgramCache]: Analyzing trace with hash -321724473, now seen corresponding path program 2 times [2018-12-02 07:11:59,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:59,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:59,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:11:59,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:59,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:59,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:59,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 07:11:59,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:59,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:11:59,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:11:59,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:11:59,409 INFO L87 Difference]: Start difference. First operand 11059 states and 36088 transitions. Second operand 7 states. [2018-12-02 07:11:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:11:59,620 INFO L93 Difference]: Finished difference Result 18635 states and 61462 transitions. [2018-12-02 07:11:59,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:11:59,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-02 07:11:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:11:59,629 INFO L225 Difference]: With dead ends: 18635 [2018-12-02 07:11:59,630 INFO L226 Difference]: Without dead ends: 7616 [2018-12-02 07:11:59,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:11:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2018-12-02 07:11:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7616. [2018-12-02 07:11:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7616 states. [2018-12-02 07:11:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7616 states to 7616 states and 25482 transitions. [2018-12-02 07:11:59,707 INFO L78 Accepts]: Start accepts. Automaton has 7616 states and 25482 transitions. Word has length 101 [2018-12-02 07:11:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:11:59,707 INFO L480 AbstractCegarLoop]: Abstraction has 7616 states and 25482 transitions. [2018-12-02 07:11:59,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:11:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 7616 states and 25482 transitions. [2018-12-02 07:11:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 07:11:59,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:11:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:11:59,714 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:11:59,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:11:59,715 INFO L82 PathProgramCache]: Analyzing trace with hash 773161459, now seen corresponding path program 3 times [2018-12-02 07:11:59,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:11:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:59,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:11:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:11:59,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:11:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:11:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:11:59,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:11:59,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 07:11:59,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:11:59,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 07:11:59,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 07:11:59,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 07:11:59,804 INFO L87 Difference]: Start difference. First operand 7616 states and 25482 transitions. Second operand 12 states. [2018-12-02 07:12:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:12:00,200 INFO L93 Difference]: Finished difference Result 14444 states and 48675 transitions. [2018-12-02 07:12:00,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 07:12:00,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-12-02 07:12:00,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:12:00,211 INFO L225 Difference]: With dead ends: 14444 [2018-12-02 07:12:00,211 INFO L226 Difference]: Without dead ends: 10540 [2018-12-02 07:12:00,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 07:12:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2018-12-02 07:12:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 9860. [2018-12-02 07:12:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9860 states. [2018-12-02 07:12:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 32373 transitions. [2018-12-02 07:12:00,307 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 32373 transitions. Word has length 101 [2018-12-02 07:12:00,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:12:00,308 INFO L480 AbstractCegarLoop]: Abstraction has 9860 states and 32373 transitions. [2018-12-02 07:12:00,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 07:12:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 32373 transitions. [2018-12-02 07:12:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 07:12:00,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:12:00,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:12:00,316 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:12:00,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:12:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash -350606857, now seen corresponding path program 4 times [2018-12-02 07:12:00,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:12:00,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:12:00,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:12:00,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:12:00,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:12:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:12:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:12:00,364 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 07:12:00,440 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 07:12:00,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:12:00 BasicIcfg [2018-12-02 07:12:00,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 07:12:00,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:12:00,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:12:00,441 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:12:00,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:10:26" (3/4) ... [2018-12-02 07:12:00,443 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 07:12:00,512 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_36b717cd-82d5-47ad-b828-ad5f294a0949/bin-2019/utaipan/witness.graphml [2018-12-02 07:12:00,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:12:00,513 INFO L168 Benchmark]: Toolchain (without parser) took 94573.50 ms. Allocated memory was 1.0 GB in the beginning and 8.1 GB in the end (delta: 7.1 GB). Free memory was 948.1 MB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-12-02 07:12:00,514 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:12:00,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-02 07:12:00,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 07:12:00,514 INFO L168 Benchmark]: Boogie Preprocessor took 21.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:12:00,514 INFO L168 Benchmark]: RCFGBuilder took 366.73 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2018-12-02 07:12:00,515 INFO L168 Benchmark]: TraceAbstraction took 93735.42 ms. Allocated memory was 1.2 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-02 07:12:00,515 INFO L168 Benchmark]: Witness Printer took 71.17 ms. Allocated memory is still 8.1 GB. Free memory was 4.9 GB in the beginning and 4.9 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-12-02 07:12:00,516 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.50 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. * RCFGBuilder took 366.73 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 93735.42 ms. Allocated memory was 1.2 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 71.17 ms. Allocated memory is still 8.1 GB. Free memory was 4.9 GB in the beginning and 4.9 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L674] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L676] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L679] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L680] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L681] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L682] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L683] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L684] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L689] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L690] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L691] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L692] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L693] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L694] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L697] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L698] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] -1 pthread_t t2500; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] FCALL, FORK -1 pthread_create(&t2500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t2501; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t2501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t2502; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t2502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 y$w_buff1 = y$w_buff0 [L738] 0 y$w_buff0 = 2 [L739] 0 y$w_buff1_used = y$w_buff0_used [L740] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L743] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L744] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L745] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L746] 0 y$r_buff0_thd3 = (_Bool)1 [L749] 0 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L702] 1 z = 2 [L705] 1 x = 1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L717] 2 x = 2 [L720] 2 y = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L753] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L759] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L724] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L724] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L725] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L726] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L730] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L786] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L787] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L788] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L793] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L794] -1 y$flush_delayed = weak$$choice2 [L795] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L798] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L802] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] -1 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y = y$flush_delayed ? y$mem_tmp : y [L805] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 197 locations, 3 error locations. UNSAFE Result, 93.6s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 26.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8069 SDtfs, 8149 SDslu, 19998 SDs, 0 SdLazy, 8064 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 106 SyntacticMatches, 21 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220276occurred in iteration=7, 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: 49.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 667571 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2698 NumberOfCodeBlocks, 2698 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2566 ConstructedInterpolants, 0 QuantifiedInterpolants, 587955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...