./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix009_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix009_tso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fe5e58ec9f352bfe46fb7ebe65bde5cd00b1134 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-91b1670 [2018-11-28 19:43:12,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 19:43:12,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 19:43:12,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 19:43:12,402 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 19:43:12,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 19:43:12,406 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 19:43:12,410 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 19:43:12,419 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 19:43:12,422 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 19:43:12,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 19:43:12,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 19:43:12,426 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 19:43:12,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 19:43:12,431 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 19:43:12,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 19:43:12,436 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 19:43:12,439 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 19:43:12,445 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 19:43:12,447 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 19:43:12,449 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 19:43:12,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 19:43:12,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 19:43:12,459 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 19:43:12,460 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 19:43:12,461 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 19:43:12,462 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 19:43:12,462 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 19:43:12,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 19:43:12,467 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 19:43:12,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 19:43:12,470 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 19:43:12,470 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 19:43:12,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 19:43:12,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 19:43:12,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 19:43:12,474 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 19:43:12,501 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 19:43:12,502 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 19:43:12,504 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 19:43:12,504 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 19:43:12,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 19:43:12,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 19:43:12,506 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 19:43:12,506 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 19:43:12,507 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 19:43:12,507 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 19:43:12,507 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 19:43:12,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 19:43:12,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 19:43:12,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 19:43:12,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 19:43:12,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 19:43:12,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 19:43:12,511 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 19:43:12,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 19:43:12,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 19:43:12,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 19:43:12,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 19:43:12,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 19:43:12,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 19:43:12,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 19:43:12,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 19:43:12,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 19:43:12,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 19:43:12,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 19:43:12,515 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 19:43:12,515 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 8fe5e58ec9f352bfe46fb7ebe65bde5cd00b1134 [2018-11-28 19:43:12,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 19:43:12,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 19:43:12,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 19:43:12,588 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 19:43:12,590 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 19:43:12,591 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix009_tso.opt_false-unreach-call.i [2018-11-28 19:43:12,646 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af8725e73/1565f3941cad4e72b08ca32ee9c29226/FLAG9f12972a1 [2018-11-28 19:43:13,240 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 19:43:13,241 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix009_tso.opt_false-unreach-call.i [2018-11-28 19:43:13,262 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af8725e73/1565f3941cad4e72b08ca32ee9c29226/FLAG9f12972a1 [2018-11-28 19:43:13,471 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af8725e73/1565f3941cad4e72b08ca32ee9c29226 [2018-11-28 19:43:13,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 19:43:13,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 19:43:13,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 19:43:13,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 19:43:13,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 19:43:13,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:43:13" (1/1) ... [2018-11-28 19:43:13,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0c55c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13, skipping insertion in model container [2018-11-28 19:43:13,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:43:13" (1/1) ... [2018-11-28 19:43:13,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 19:43:13,587 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 19:43:14,085 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:43:14,108 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 19:43:14,330 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:43:14,424 INFO L195 MainTranslator]: Completed translation [2018-11-28 19:43:14,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14 WrapperNode [2018-11-28 19:43:14,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 19:43:14,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 19:43:14,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 19:43:14,426 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 19:43:14,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14" (1/1) ... [2018-11-28 19:43:14,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14" (1/1) ... [2018-11-28 19:43:14,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 19:43:14,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 19:43:14,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 19:43:14,502 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 19:43:14,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14" (1/1) ... [2018-11-28 19:43:14,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14" (1/1) ... [2018-11-28 19:43:14,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14" (1/1) ... [2018-11-28 19:43:14,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14" (1/1) ... [2018-11-28 19:43:14,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14" (1/1) ... [2018-11-28 19:43:14,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14" (1/1) ... [2018-11-28 19:43:14,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14" (1/1) ... [2018-11-28 19:43:14,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 19:43:14,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 19:43:14,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 19:43:14,562 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 19:43:14,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 19:43:14,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 19:43:14,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 19:43:14,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 19:43:14,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 19:43:14,629 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 19:43:14,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 19:43:14,629 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 19:43:14,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 19:43:14,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 19:43:14,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 19:43:14,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 19:43:14,635 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 19:43:16,102 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 19:43:16,103 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 19:43:16,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:43:16 BoogieIcfgContainer [2018-11-28 19:43:16,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 19:43:16,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 19:43:16,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 19:43:16,109 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 19:43:16,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:43:13" (1/3) ... [2018-11-28 19:43:16,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6327e00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:43:16, skipping insertion in model container [2018-11-28 19:43:16,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:14" (2/3) ... [2018-11-28 19:43:16,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6327e00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:43:16, skipping insertion in model container [2018-11-28 19:43:16,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:43:16" (3/3) ... [2018-11-28 19:43:16,114 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_tso.opt_false-unreach-call.i [2018-11-28 19:43:16,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,174 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,175 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,188 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,194 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,194 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,194 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,194 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,196 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,196 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,213 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,213 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,213 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,214 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,214 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:16,273 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 19:43:16,273 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 19:43:16,283 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 19:43:16,301 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 19:43:16,326 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 19:43:16,327 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 19:43:16,327 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 19:43:16,327 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 19:43:16,327 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 19:43:16,327 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 19:43:16,328 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 19:43:16,328 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 19:43:16,328 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 19:43:16,344 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 175places, 228 transitions [2018-11-28 19:43:25,275 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83129 states. [2018-11-28 19:43:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 83129 states. [2018-11-28 19:43:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 19:43:25,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:25,290 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] [2018-11-28 19:43:25,293 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:25,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash 459405505, now seen corresponding path program 1 times [2018-11-28 19:43:25,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:25,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:25,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:25,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:25,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:25,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:25,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:25,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:25,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:25,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:25,800 INFO L87 Difference]: Start difference. First operand 83129 states. Second operand 4 states. [2018-11-28 19:43:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:28,473 INFO L93 Difference]: Finished difference Result 150585 states and 603162 transitions. [2018-11-28 19:43:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:28,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-28 19:43:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:29,213 INFO L225 Difference]: With dead ends: 150585 [2018-11-28 19:43:29,213 INFO L226 Difference]: Without dead ends: 105841 [2018-11-28 19:43:29,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105841 states. [2018-11-28 19:43:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105841 to 61237. [2018-11-28 19:43:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61237 states. [2018-11-28 19:43:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61237 states to 61237 states and 248292 transitions. [2018-11-28 19:43:33,868 INFO L78 Accepts]: Start accepts. Automaton has 61237 states and 248292 transitions. Word has length 40 [2018-11-28 19:43:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:33,869 INFO L480 AbstractCegarLoop]: Abstraction has 61237 states and 248292 transitions. [2018-11-28 19:43:33,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 61237 states and 248292 transitions. [2018-11-28 19:43:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 19:43:33,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:33,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:33,882 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:33,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash -465402434, now seen corresponding path program 1 times [2018-11-28 19:43:33,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:33,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:33,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:33,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:33,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:34,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:34,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:34,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:34,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:34,019 INFO L87 Difference]: Start difference. First operand 61237 states and 248292 transitions. Second operand 4 states. [2018-11-28 19:43:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:35,515 INFO L93 Difference]: Finished difference Result 14311 states and 48365 transitions. [2018-11-28 19:43:35,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:43:35,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-28 19:43:35,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:35,563 INFO L225 Difference]: With dead ends: 14311 [2018-11-28 19:43:35,563 INFO L226 Difference]: Without dead ends: 11491 [2018-11-28 19:43:35,564 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-11-28 19:43:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11491 states. [2018-11-28 19:43:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11491 to 11491. [2018-11-28 19:43:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11491 states. [2018-11-28 19:43:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11491 states to 11491 states and 37856 transitions. [2018-11-28 19:43:35,861 INFO L78 Accepts]: Start accepts. Automaton has 11491 states and 37856 transitions. Word has length 48 [2018-11-28 19:43:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:35,862 INFO L480 AbstractCegarLoop]: Abstraction has 11491 states and 37856 transitions. [2018-11-28 19:43:35,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 11491 states and 37856 transitions. [2018-11-28 19:43:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 19:43:35,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:35,867 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-11-28 19:43:35,867 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:35,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:35,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1761930056, now seen corresponding path program 1 times [2018-11-28 19:43:35,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:35,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:36,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:36,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:36,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:36,189 INFO L87 Difference]: Start difference. First operand 11491 states and 37856 transitions. Second operand 5 states. [2018-11-28 19:43:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:37,780 INFO L93 Difference]: Finished difference Result 23361 states and 75857 transitions. [2018-11-28 19:43:37,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:37,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-28 19:43:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:37,858 INFO L225 Difference]: With dead ends: 23361 [2018-11-28 19:43:37,859 INFO L226 Difference]: Without dead ends: 23286 [2018-11-28 19:43:37,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:37,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23286 states. [2018-11-28 19:43:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23286 to 15418. [2018-11-28 19:43:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15418 states. [2018-11-28 19:43:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15418 states to 15418 states and 49311 transitions. [2018-11-28 19:43:38,309 INFO L78 Accepts]: Start accepts. Automaton has 15418 states and 49311 transitions. Word has length 49 [2018-11-28 19:43:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:38,311 INFO L480 AbstractCegarLoop]: Abstraction has 15418 states and 49311 transitions. [2018-11-28 19:43:38,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 15418 states and 49311 transitions. [2018-11-28 19:43:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 19:43:38,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:38,314 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-11-28 19:43:38,315 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:38,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1880248814, now seen corresponding path program 1 times [2018-11-28 19:43:38,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:38,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:38,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:38,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:38,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:38,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:38,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:38,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:38,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:38,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:38,402 INFO L87 Difference]: Start difference. First operand 15418 states and 49311 transitions. Second operand 3 states. [2018-11-28 19:43:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:38,799 INFO L93 Difference]: Finished difference Result 28678 states and 90549 transitions. [2018-11-28 19:43:38,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:38,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-28 19:43:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:38,895 INFO L225 Difference]: With dead ends: 28678 [2018-11-28 19:43:38,895 INFO L226 Difference]: Without dead ends: 28674 [2018-11-28 19:43:38,896 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-11-28 19:43:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28674 states. [2018-11-28 19:43:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28674 to 24153. [2018-11-28 19:43:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24153 states. [2018-11-28 19:43:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24153 states to 24153 states and 76317 transitions. [2018-11-28 19:43:39,503 INFO L78 Accepts]: Start accepts. Automaton has 24153 states and 76317 transitions. Word has length 51 [2018-11-28 19:43:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:39,504 INFO L480 AbstractCegarLoop]: Abstraction has 24153 states and 76317 transitions. [2018-11-28 19:43:39,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 24153 states and 76317 transitions. [2018-11-28 19:43:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 19:43:39,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:39,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:39,511 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:39,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:39,511 INFO L82 PathProgramCache]: Analyzing trace with hash 832863033, now seen corresponding path program 1 times [2018-11-28 19:43:39,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:39,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:39,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:39,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:39,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:39,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:39,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:39,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:39,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:39,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:39,755 INFO L87 Difference]: Start difference. First operand 24153 states and 76317 transitions. Second operand 6 states. [2018-11-28 19:43:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:40,919 INFO L93 Difference]: Finished difference Result 33839 states and 105315 transitions. [2018-11-28 19:43:40,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:40,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-28 19:43:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:40,997 INFO L225 Difference]: With dead ends: 33839 [2018-11-28 19:43:40,997 INFO L226 Difference]: Without dead ends: 33742 [2018-11-28 19:43:40,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:43:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33742 states. [2018-11-28 19:43:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33742 to 23974. [2018-11-28 19:43:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23974 states. [2018-11-28 19:43:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23974 states to 23974 states and 75823 transitions. [2018-11-28 19:43:42,178 INFO L78 Accepts]: Start accepts. Automaton has 23974 states and 75823 transitions. Word has length 55 [2018-11-28 19:43:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:42,179 INFO L480 AbstractCegarLoop]: Abstraction has 23974 states and 75823 transitions. [2018-11-28 19:43:42,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 23974 states and 75823 transitions. [2018-11-28 19:43:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 19:43:42,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:42,193 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-11-28 19:43:42,193 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:42,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash 974144113, now seen corresponding path program 1 times [2018-11-28 19:43:42,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:42,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:42,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:42,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:42,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:42,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-11-28 19:43:42,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:42,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:42,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:42,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:42,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:42,413 INFO L87 Difference]: Start difference. First operand 23974 states and 75823 transitions. Second operand 4 states. [2018-11-28 19:43:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:42,914 INFO L93 Difference]: Finished difference Result 30738 states and 97933 transitions. [2018-11-28 19:43:42,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:43:42,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-28 19:43:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:42,970 INFO L225 Difference]: With dead ends: 30738 [2018-11-28 19:43:42,970 INFO L226 Difference]: Without dead ends: 30738 [2018-11-28 19:43:42,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30738 states. [2018-11-28 19:43:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30738 to 27610. [2018-11-28 19:43:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27610 states. [2018-11-28 19:43:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 87451 transitions. [2018-11-28 19:43:43,447 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 87451 transitions. Word has length 65 [2018-11-28 19:43:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:43,447 INFO L480 AbstractCegarLoop]: Abstraction has 27610 states and 87451 transitions. [2018-11-28 19:43:43,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 87451 transitions. [2018-11-28 19:43:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 19:43:43,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:43,461 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-11-28 19:43:43,461 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:43,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:43,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1578012848, now seen corresponding path program 1 times [2018-11-28 19:43:43,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:43,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:43,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:43,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:43,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:43,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:43,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:43,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:43,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:43,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:43,727 INFO L87 Difference]: Start difference. First operand 27610 states and 87451 transitions. Second operand 5 states. [2018-11-28 19:43:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:44,017 INFO L93 Difference]: Finished difference Result 10334 states and 27418 transitions. [2018-11-28 19:43:44,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 19:43:44,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 19:43:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:44,033 INFO L225 Difference]: With dead ends: 10334 [2018-11-28 19:43:44,033 INFO L226 Difference]: Without dead ends: 8706 [2018-11-28 19:43:44,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states. [2018-11-28 19:43:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 7459. [2018-11-28 19:43:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7459 states. [2018-11-28 19:43:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7459 states to 7459 states and 19347 transitions. [2018-11-28 19:43:44,172 INFO L78 Accepts]: Start accepts. Automaton has 7459 states and 19347 transitions. Word has length 65 [2018-11-28 19:43:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:44,172 INFO L480 AbstractCegarLoop]: Abstraction has 7459 states and 19347 transitions. [2018-11-28 19:43:44,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7459 states and 19347 transitions. [2018-11-28 19:43:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 19:43:44,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 19:43:44,190 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:44,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:44,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1002193287, now seen corresponding path program 1 times [2018-11-28 19:43:44,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:44,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:44,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:44,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:44,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:44,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-11-28 19:43:44,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:44,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:44,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:44,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:44,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:44,382 INFO L87 Difference]: Start difference. First operand 7459 states and 19347 transitions. Second operand 4 states. [2018-11-28 19:43:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:44,870 INFO L93 Difference]: Finished difference Result 14929 states and 36703 transitions. [2018-11-28 19:43:44,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:43:44,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-28 19:43:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:44,892 INFO L225 Difference]: With dead ends: 14929 [2018-11-28 19:43:44,892 INFO L226 Difference]: Without dead ends: 14929 [2018-11-28 19:43:44,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14929 states. [2018-11-28 19:43:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14929 to 11547. [2018-11-28 19:43:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11547 states. [2018-11-28 19:43:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11547 states to 11547 states and 29056 transitions. [2018-11-28 19:43:45,058 INFO L78 Accepts]: Start accepts. Automaton has 11547 states and 29056 transitions. Word has length 100 [2018-11-28 19:43:45,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:45,059 INFO L480 AbstractCegarLoop]: Abstraction has 11547 states and 29056 transitions. [2018-11-28 19:43:45,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 11547 states and 29056 transitions. [2018-11-28 19:43:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 19:43:45,079 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:45,079 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] [2018-11-28 19:43:45,079 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:45,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:45,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1331959048, now seen corresponding path program 1 times [2018-11-28 19:43:45,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:45,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:45,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:45,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:45,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:45,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:45,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:45,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:45,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:45,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:45,216 INFO L87 Difference]: Start difference. First operand 11547 states and 29056 transitions. Second operand 4 states. [2018-11-28 19:43:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:45,504 INFO L93 Difference]: Finished difference Result 11851 states and 29864 transitions. [2018-11-28 19:43:45,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:43:45,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-28 19:43:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:45,521 INFO L225 Difference]: With dead ends: 11851 [2018-11-28 19:43:45,521 INFO L226 Difference]: Without dead ends: 11851 [2018-11-28 19:43:45,521 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-11-28 19:43:45,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11851 states. [2018-11-28 19:43:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11851 to 11643. [2018-11-28 19:43:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11643 states. [2018-11-28 19:43:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11643 states to 11643 states and 29328 transitions. [2018-11-28 19:43:45,680 INFO L78 Accepts]: Start accepts. Automaton has 11643 states and 29328 transitions. Word has length 100 [2018-11-28 19:43:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:45,680 INFO L480 AbstractCegarLoop]: Abstraction has 11643 states and 29328 transitions. [2018-11-28 19:43:45,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 11643 states and 29328 transitions. [2018-11-28 19:43:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 19:43:45,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:45,698 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] [2018-11-28 19:43:45,699 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:45,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:45,699 INFO L82 PathProgramCache]: Analyzing trace with hash -475495415, now seen corresponding path program 1 times [2018-11-28 19:43:45,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:45,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:45,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:45,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:45,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:46,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:46,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:46,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:46,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:46,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:46,009 INFO L87 Difference]: Start difference. First operand 11643 states and 29328 transitions. Second operand 7 states. [2018-11-28 19:43:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:47,091 INFO L93 Difference]: Finished difference Result 16074 states and 39733 transitions. [2018-11-28 19:43:47,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:47,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-11-28 19:43:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:47,115 INFO L225 Difference]: With dead ends: 16074 [2018-11-28 19:43:47,115 INFO L226 Difference]: Without dead ends: 16074 [2018-11-28 19:43:47,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:43:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16074 states. [2018-11-28 19:43:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16074 to 13506. [2018-11-28 19:43:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13506 states. [2018-11-28 19:43:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13506 states to 13506 states and 33955 transitions. [2018-11-28 19:43:47,331 INFO L78 Accepts]: Start accepts. Automaton has 13506 states and 33955 transitions. Word has length 100 [2018-11-28 19:43:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:47,331 INFO L480 AbstractCegarLoop]: Abstraction has 13506 states and 33955 transitions. [2018-11-28 19:43:47,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 13506 states and 33955 transitions. [2018-11-28 19:43:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 19:43:47,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:47,355 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] [2018-11-28 19:43:47,355 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:47,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1249985482, now seen corresponding path program 1 times [2018-11-28 19:43:47,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:47,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:47,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:47,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:47,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:47,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:47,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:47,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:47,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:47,680 INFO L87 Difference]: Start difference. First operand 13506 states and 33955 transitions. Second operand 5 states. [2018-11-28 19:43:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:48,418 INFO L93 Difference]: Finished difference Result 18063 states and 44112 transitions. [2018-11-28 19:43:48,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:43:48,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-11-28 19:43:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:48,446 INFO L225 Difference]: With dead ends: 18063 [2018-11-28 19:43:48,446 INFO L226 Difference]: Without dead ends: 18063 [2018-11-28 19:43:48,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18063 states. [2018-11-28 19:43:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18063 to 15125. [2018-11-28 19:43:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15125 states. [2018-11-28 19:43:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15125 states to 15125 states and 37602 transitions. [2018-11-28 19:43:48,679 INFO L78 Accepts]: Start accepts. Automaton has 15125 states and 37602 transitions. Word has length 100 [2018-11-28 19:43:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:48,679 INFO L480 AbstractCegarLoop]: Abstraction has 15125 states and 37602 transitions. [2018-11-28 19:43:48,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 15125 states and 37602 transitions. [2018-11-28 19:43:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 19:43:48,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:48,702 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] [2018-11-28 19:43:48,703 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:48,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:48,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1503291686, now seen corresponding path program 2 times [2018-11-28 19:43:48,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:48,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:48,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:48,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:49,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:49,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:49,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:49,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:49,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:49,026 INFO L87 Difference]: Start difference. First operand 15125 states and 37602 transitions. Second operand 6 states. [2018-11-28 19:43:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:49,393 INFO L93 Difference]: Finished difference Result 15045 states and 37258 transitions. [2018-11-28 19:43:49,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:49,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-11-28 19:43:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:49,417 INFO L225 Difference]: With dead ends: 15045 [2018-11-28 19:43:49,417 INFO L226 Difference]: Without dead ends: 15045 [2018-11-28 19:43:49,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15045 states. [2018-11-28 19:43:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15045 to 13753. [2018-11-28 19:43:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13753 states. [2018-11-28 19:43:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13753 states to 13753 states and 34312 transitions. [2018-11-28 19:43:49,890 INFO L78 Accepts]: Start accepts. Automaton has 13753 states and 34312 transitions. Word has length 100 [2018-11-28 19:43:49,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:49,890 INFO L480 AbstractCegarLoop]: Abstraction has 13753 states and 34312 transitions. [2018-11-28 19:43:49,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 13753 states and 34312 transitions. [2018-11-28 19:43:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 19:43:49,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:49,911 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, 1] [2018-11-28 19:43:49,912 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:49,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:49,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2002150678, now seen corresponding path program 1 times [2018-11-28 19:43:49,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:49,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:49,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:49,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:49,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:50,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:50,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 19:43:50,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 19:43:50,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 19:43:50,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:50,188 INFO L87 Difference]: Start difference. First operand 13753 states and 34312 transitions. Second operand 8 states. [2018-11-28 19:43:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:51,058 INFO L93 Difference]: Finished difference Result 15795 states and 38746 transitions. [2018-11-28 19:43:51,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 19:43:51,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-11-28 19:43:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:51,080 INFO L225 Difference]: With dead ends: 15795 [2018-11-28 19:43:51,081 INFO L226 Difference]: Without dead ends: 15795 [2018-11-28 19:43:51,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-11-28 19:43:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15795 states. [2018-11-28 19:43:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15795 to 14771. [2018-11-28 19:43:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14771 states. [2018-11-28 19:43:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14771 states to 14771 states and 36565 transitions. [2018-11-28 19:43:51,281 INFO L78 Accepts]: Start accepts. Automaton has 14771 states and 36565 transitions. Word has length 102 [2018-11-28 19:43:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:51,282 INFO L480 AbstractCegarLoop]: Abstraction has 14771 states and 36565 transitions. [2018-11-28 19:43:51,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 19:43:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 14771 states and 36565 transitions. [2018-11-28 19:43:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 19:43:51,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:51,299 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, 1] [2018-11-28 19:43:51,300 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:51,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1405312937, now seen corresponding path program 1 times [2018-11-28 19:43:51,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:51,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:51,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:51,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:51,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:51,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:51,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:51,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:51,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:51,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:51,392 INFO L87 Difference]: Start difference. First operand 14771 states and 36565 transitions. Second operand 3 states. [2018-11-28 19:43:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:51,504 INFO L93 Difference]: Finished difference Result 19038 states and 47103 transitions. [2018-11-28 19:43:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:51,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-28 19:43:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:51,528 INFO L225 Difference]: With dead ends: 19038 [2018-11-28 19:43:51,528 INFO L226 Difference]: Without dead ends: 19038 [2018-11-28 19:43:51,529 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-11-28 19:43:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19038 states. [2018-11-28 19:43:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19038 to 18955. [2018-11-28 19:43:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18955 states. [2018-11-28 19:43:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18955 states to 18955 states and 46924 transitions. [2018-11-28 19:43:51,741 INFO L78 Accepts]: Start accepts. Automaton has 18955 states and 46924 transitions. Word has length 102 [2018-11-28 19:43:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:51,742 INFO L480 AbstractCegarLoop]: Abstraction has 18955 states and 46924 transitions. [2018-11-28 19:43:51,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 46924 transitions. [2018-11-28 19:43:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 19:43:51,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:51,771 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, 1] [2018-11-28 19:43:51,771 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:51,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:51,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1193962024, now seen corresponding path program 1 times [2018-11-28 19:43:51,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:51,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:51,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:51,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:51,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:52,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:52,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:52,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:52,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:52,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:52,030 INFO L87 Difference]: Start difference. First operand 18955 states and 46924 transitions. Second operand 4 states. [2018-11-28 19:43:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:52,382 INFO L93 Difference]: Finished difference Result 19455 states and 47839 transitions. [2018-11-28 19:43:52,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:52,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-28 19:43:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:52,409 INFO L225 Difference]: With dead ends: 19455 [2018-11-28 19:43:52,409 INFO L226 Difference]: Without dead ends: 19455 [2018-11-28 19:43:52,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19455 states. [2018-11-28 19:43:52,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19455 to 19132. [2018-11-28 19:43:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19132 states. [2018-11-28 19:43:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19132 states to 19132 states and 47144 transitions. [2018-11-28 19:43:52,649 INFO L78 Accepts]: Start accepts. Automaton has 19132 states and 47144 transitions. Word has length 102 [2018-11-28 19:43:52,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:52,649 INFO L480 AbstractCegarLoop]: Abstraction has 19132 states and 47144 transitions. [2018-11-28 19:43:52,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 19132 states and 47144 transitions. [2018-11-28 19:43:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 19:43:52,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:52,676 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, 1] [2018-11-28 19:43:52,677 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:52,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:52,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1478572905, now seen corresponding path program 2 times [2018-11-28 19:43:52,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:52,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:52,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:53,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:53,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:53,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:53,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:53,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:53,152 INFO L87 Difference]: Start difference. First operand 19132 states and 47144 transitions. Second operand 5 states. [2018-11-28 19:43:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:54,039 INFO L93 Difference]: Finished difference Result 19768 states and 48491 transitions. [2018-11-28 19:43:54,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 19:43:54,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-28 19:43:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:54,067 INFO L225 Difference]: With dead ends: 19768 [2018-11-28 19:43:54,067 INFO L226 Difference]: Without dead ends: 19768 [2018-11-28 19:43:54,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2018-11-28 19:43:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 19132. [2018-11-28 19:43:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19132 states. [2018-11-28 19:43:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19132 states to 19132 states and 47136 transitions. [2018-11-28 19:43:54,307 INFO L78 Accepts]: Start accepts. Automaton has 19132 states and 47136 transitions. Word has length 102 [2018-11-28 19:43:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:54,307 INFO L480 AbstractCegarLoop]: Abstraction has 19132 states and 47136 transitions. [2018-11-28 19:43:54,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 19132 states and 47136 transitions. [2018-11-28 19:43:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 19:43:54,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:54,329 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, 1] [2018-11-28 19:43:54,330 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:54,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:54,330 INFO L82 PathProgramCache]: Analyzing trace with hash 405390625, now seen corresponding path program 3 times [2018-11-28 19:43:54,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:54,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:54,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:54,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:54,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:54,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:54,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:54,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:54,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:54,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:54,780 INFO L87 Difference]: Start difference. First operand 19132 states and 47136 transitions. Second operand 6 states. [2018-11-28 19:43:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:56,151 INFO L93 Difference]: Finished difference Result 22653 states and 55732 transitions. [2018-11-28 19:43:56,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:43:56,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-11-28 19:43:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:56,184 INFO L225 Difference]: With dead ends: 22653 [2018-11-28 19:43:56,184 INFO L226 Difference]: Without dead ends: 22653 [2018-11-28 19:43:56,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22653 states. [2018-11-28 19:43:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22653 to 19426. [2018-11-28 19:43:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19426 states. [2018-11-28 19:43:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19426 states to 19426 states and 47863 transitions. [2018-11-28 19:43:56,460 INFO L78 Accepts]: Start accepts. Automaton has 19426 states and 47863 transitions. Word has length 102 [2018-11-28 19:43:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:56,460 INFO L480 AbstractCegarLoop]: Abstraction has 19426 states and 47863 transitions. [2018-11-28 19:43:56,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 19426 states and 47863 transitions. [2018-11-28 19:43:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 19:43:56,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:56,482 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, 1] [2018-11-28 19:43:56,482 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:56,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:56,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2066029025, now seen corresponding path program 4 times [2018-11-28 19:43:56,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:56,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:56,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:56,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:56,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:56,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:56,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:56,602 INFO L87 Difference]: Start difference. First operand 19426 states and 47863 transitions. Second operand 5 states. [2018-11-28 19:43:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:56,976 INFO L93 Difference]: Finished difference Result 21059 states and 51384 transitions. [2018-11-28 19:43:56,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 19:43:56,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-28 19:43:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:57,007 INFO L225 Difference]: With dead ends: 21059 [2018-11-28 19:43:57,007 INFO L226 Difference]: Without dead ends: 21059 [2018-11-28 19:43:57,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-11-28 19:43:57,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21059 states. [2018-11-28 19:43:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21059 to 20069. [2018-11-28 19:43:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20069 states. [2018-11-28 19:43:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20069 states to 20069 states and 49247 transitions. [2018-11-28 19:43:57,273 INFO L78 Accepts]: Start accepts. Automaton has 20069 states and 49247 transitions. Word has length 102 [2018-11-28 19:43:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:57,274 INFO L480 AbstractCegarLoop]: Abstraction has 20069 states and 49247 transitions. [2018-11-28 19:43:57,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 20069 states and 49247 transitions. [2018-11-28 19:43:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 19:43:57,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:57,297 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, 1, 1, 1] [2018-11-28 19:43:57,297 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:57,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1644889549, now seen corresponding path program 1 times [2018-11-28 19:43:57,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:57,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:57,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:57,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:57,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:57,536 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 19:43:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:57,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:57,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 19:43:57,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 19:43:57,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 19:43:57,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:57,878 INFO L87 Difference]: Start difference. First operand 20069 states and 49247 transitions. Second operand 8 states. [2018-11-28 19:43:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:58,603 INFO L93 Difference]: Finished difference Result 21820 states and 53337 transitions. [2018-11-28 19:43:58,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:43:58,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2018-11-28 19:43:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:58,611 INFO L225 Difference]: With dead ends: 21820 [2018-11-28 19:43:58,611 INFO L226 Difference]: Without dead ends: 4847 [2018-11-28 19:43:58,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:43:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2018-11-28 19:43:58,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 4845. [2018-11-28 19:43:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2018-11-28 19:43:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 12020 transitions. [2018-11-28 19:43:58,667 INFO L78 Accepts]: Start accepts. Automaton has 4845 states and 12020 transitions. Word has length 104 [2018-11-28 19:43:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:58,667 INFO L480 AbstractCegarLoop]: Abstraction has 4845 states and 12020 transitions. [2018-11-28 19:43:58,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 19:43:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4845 states and 12020 transitions. [2018-11-28 19:43:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 19:43:58,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:58,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, 1, 1, 1, 1, 1] [2018-11-28 19:43:58,674 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:58,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash 265549278, now seen corresponding path program 1 times [2018-11-28 19:43:58,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:58,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:58,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:58,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:58,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:58,959 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 19:43:59,140 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 19:43:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:59,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:59,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 19:43:59,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 19:43:59,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 19:43:59,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:43:59,710 INFO L87 Difference]: Start difference. First operand 4845 states and 12020 transitions. Second operand 13 states. [2018-11-28 19:44:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:44:00,670 INFO L93 Difference]: Finished difference Result 7912 states and 19287 transitions. [2018-11-28 19:44:00,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 19:44:00,671 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2018-11-28 19:44:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:44:00,679 INFO L225 Difference]: With dead ends: 7912 [2018-11-28 19:44:00,679 INFO L226 Difference]: Without dead ends: 5829 [2018-11-28 19:44:00,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-11-28 19:44:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5829 states. [2018-11-28 19:44:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5829 to 4945. [2018-11-28 19:44:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2018-11-28 19:44:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 12200 transitions. [2018-11-28 19:44:00,745 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 12200 transitions. Word has length 104 [2018-11-28 19:44:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:44:00,745 INFO L480 AbstractCegarLoop]: Abstraction has 4945 states and 12200 transitions. [2018-11-28 19:44:00,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 19:44:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 12200 transitions. [2018-11-28 19:44:00,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 19:44:00,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:44:00,751 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, 1, 1, 1] [2018-11-28 19:44:00,751 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:44:00,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:44:00,752 INFO L82 PathProgramCache]: Analyzing trace with hash 248602942, now seen corresponding path program 2 times [2018-11-28 19:44:00,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:44:00,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:44:00,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:44:00,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:44:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:44:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:44:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:44:01,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:44:01,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 19:44:01,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 19:44:01,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 19:44:01,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-28 19:44:01,032 INFO L87 Difference]: Start difference. First operand 4945 states and 12200 transitions. Second operand 14 states. [2018-11-28 19:44:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:44:03,216 INFO L93 Difference]: Finished difference Result 9535 states and 23742 transitions. [2018-11-28 19:44:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 19:44:03,217 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 104 [2018-11-28 19:44:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:44:03,225 INFO L225 Difference]: With dead ends: 9535 [2018-11-28 19:44:03,225 INFO L226 Difference]: Without dead ends: 5903 [2018-11-28 19:44:03,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-11-28 19:44:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2018-11-28 19:44:03,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 5855. [2018-11-28 19:44:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5855 states. [2018-11-28 19:44:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5855 states to 5855 states and 14554 transitions. [2018-11-28 19:44:03,297 INFO L78 Accepts]: Start accepts. Automaton has 5855 states and 14554 transitions. Word has length 104 [2018-11-28 19:44:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:44:03,298 INFO L480 AbstractCegarLoop]: Abstraction has 5855 states and 14554 transitions. [2018-11-28 19:44:03,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 19:44:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 5855 states and 14554 transitions. [2018-11-28 19:44:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 19:44:03,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:44:03,305 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, 1, 1, 1] [2018-11-28 19:44:03,305 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:44:03,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:44:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1469195098, now seen corresponding path program 3 times [2018-11-28 19:44:03,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:44:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:44:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:44:03,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:44:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:44:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:44:03,513 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 19:44:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:44:03,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:44:03,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 19:44:03,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 19:44:03,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 19:44:03,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:44:03,609 INFO L87 Difference]: Start difference. First operand 5855 states and 14554 transitions. Second operand 13 states. [2018-11-28 19:44:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:44:04,458 INFO L93 Difference]: Finished difference Result 9184 states and 22414 transitions. [2018-11-28 19:44:04,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 19:44:04,459 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2018-11-28 19:44:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:44:04,470 INFO L225 Difference]: With dead ends: 9184 [2018-11-28 19:44:04,470 INFO L226 Difference]: Without dead ends: 8253 [2018-11-28 19:44:04,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-11-28 19:44:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8253 states. [2018-11-28 19:44:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8253 to 5875. [2018-11-28 19:44:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5875 states. [2018-11-28 19:44:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5875 states to 5875 states and 14603 transitions. [2018-11-28 19:44:04,564 INFO L78 Accepts]: Start accepts. Automaton has 5875 states and 14603 transitions. Word has length 104 [2018-11-28 19:44:04,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:44:04,565 INFO L480 AbstractCegarLoop]: Abstraction has 5875 states and 14603 transitions. [2018-11-28 19:44:04,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 19:44:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5875 states and 14603 transitions. [2018-11-28 19:44:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 19:44:04,571 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:44:04,572 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, 1, 1, 1] [2018-11-28 19:44:04,572 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:44:04,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:44:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash -720978081, now seen corresponding path program 1 times [2018-11-28 19:44:04,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:44:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:44:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:44:04,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:44:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:44:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:44:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:44:04,657 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 19:44:04,867 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 19:44:04,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:44:04 BasicIcfg [2018-11-28 19:44:04,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 19:44:04,870 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 19:44:04,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 19:44:04,870 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 19:44:04,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:43:16" (3/4) ... [2018-11-28 19:44:04,876 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 19:44:05,070 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 19:44:05,075 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 19:44:05,076 INFO L168 Benchmark]: Toolchain (without parser) took 51598.89 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 943.3 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 19:44:05,080 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 19:44:05,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 945.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-11-28 19:44:05,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.87 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 19:44:05,081 INFO L168 Benchmark]: Boogie Preprocessor took 59.64 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-11-28 19:44:05,081 INFO L168 Benchmark]: RCFGBuilder took 1542.11 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: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2018-11-28 19:44:05,081 INFO L168 Benchmark]: TraceAbstraction took 48764.32 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-28 19:44:05,084 INFO L168 Benchmark]: Witness Printer took 204.98 ms. Allocated memory is still 3.7 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2018-11-28 19:44:05,087 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 945.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.87 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.64 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 1542.11 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: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48764.32 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 204.98 ms. Allocated memory is still 3.7 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: 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] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L692] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0] [L693] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0] [L694] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L794] -1 pthread_t t257; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L795] FCALL, FORK -1 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L796] -1 pthread_t t258; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L797] FCALL, FORK -1 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L742] 0 y$w_buff1 = y$w_buff0 [L743] 0 y$w_buff0 = 1 [L744] 0 y$w_buff1_used = y$w_buff0_used [L745] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L748] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L749] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L750] 0 y$r_buff0_thd2 = (_Bool)1 [L753] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 0 y$flush_delayed = weak$$choice2 [L756] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L761] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L762] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 0 y = y$flush_delayed ? y$mem_tmp : y [L766] 0 y$flush_delayed = (_Bool)0 [L769] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L708] 1 z = 1 [L711] 1 x = 1 [L714] 1 __unbuffered_p0_EAX = x [L717] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 1 y$flush_delayed = weak$$choice2 [L720] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L722] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L722] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L723] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L724] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L724] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L725] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L727] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 y = y$flush_delayed ? y$mem_tmp : y [L730] 1 y$flush_delayed = (_Bool)0 [L735] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] EXPR 0 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 0 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 [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] EXPR 0 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 0 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 [L779] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -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) [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L804] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L805] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] -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 [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L807] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -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 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 285 locations, 3 error locations. UNSAFE Result, 48.5s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 21.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7383 SDtfs, 7865 SDslu, 20856 SDs, 0 SdLazy, 6030 SolverSat, 306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83129occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 10.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 91119 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2005 NumberOfCodeBlocks, 2005 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1879 ConstructedInterpolants, 0 QuantifiedInterpolants, 408442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...