./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96530338 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 ../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc_true-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 5d7e08eb1aa42a48feeefe6b4b7860eb66c28d80 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-9653033 [2018-11-26 13:11:47,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-26 13:11:47,450 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-26 13:11:47,462 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-26 13:11:47,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-26 13:11:47,463 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-26 13:11:47,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-26 13:11:47,466 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-26 13:11:47,468 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-26 13:11:47,469 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-26 13:11:47,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-26 13:11:47,471 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-26 13:11:47,471 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-26 13:11:47,472 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-26 13:11:47,473 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-26 13:11:47,474 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-26 13:11:47,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-26 13:11:47,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-26 13:11:47,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-26 13:11:47,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-26 13:11:47,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-26 13:11:47,483 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-26 13:11:47,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-26 13:11:47,485 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-26 13:11:47,485 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-26 13:11:47,486 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-26 13:11:47,487 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-26 13:11:47,488 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-26 13:11:47,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-26 13:11:47,490 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-26 13:11:47,490 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-26 13:11:47,491 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-26 13:11:47,491 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-26 13:11:47,491 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-26 13:11:47,492 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-26 13:11:47,493 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-26 13:11:47,493 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-26 13:11:47,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-26 13:11:47,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-26 13:11:47,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-26 13:11:47,509 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-26 13:11:47,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-26 13:11:47,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-26 13:11:47,510 INFO L133 SettingsManager]: * Use SBE=true [2018-11-26 13:11:47,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-26 13:11:47,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-26 13:11:47,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-26 13:11:47,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-26 13:11:47,511 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-26 13:11:47,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-26 13:11:47,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-26 13:11:47,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-26 13:11:47,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-26 13:11:47,512 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-26 13:11:47,512 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-26 13:11:47,512 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-26 13:11:47,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-26 13:11:47,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-26 13:11:47,513 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-26 13:11:47,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-26 13:11:47,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-26 13:11:47,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-26 13:11:47,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-26 13:11:47,514 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-26 13:11:47,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-26 13:11:47,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-26 13:11:47,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-26 13:11:47,514 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 -> 5d7e08eb1aa42a48feeefe6b4b7860eb66c28d80 [2018-11-26 13:11:47,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-26 13:11:47,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-26 13:11:47,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-26 13:11:47,580 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-26 13:11:47,580 INFO L276 PluginConnector]: CDTParser initialized [2018-11-26 13:11:47,581 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc_true-unreach-call.i [2018-11-26 13:11:47,630 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e46b578/ad74b0d48dc14f90b81edfaf986216fb/FLAGf8f6aa580 [2018-11-26 13:11:48,078 INFO L307 CDTParser]: Found 1 translation units. [2018-11-26 13:11:48,078 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc_true-unreach-call.i [2018-11-26 13:11:48,091 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e46b578/ad74b0d48dc14f90b81edfaf986216fb/FLAGf8f6aa580 [2018-11-26 13:11:48,105 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e46b578/ad74b0d48dc14f90b81edfaf986216fb [2018-11-26 13:11:48,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-26 13:11:48,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-26 13:11:48,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-26 13:11:48,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-26 13:11:48,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-26 13:11:48,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:11:48" (1/1) ... [2018-11-26 13:11:48,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555ec27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48, skipping insertion in model container [2018-11-26 13:11:48,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:11:48" (1/1) ... [2018-11-26 13:11:48,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-26 13:11:48,181 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-26 13:11:48,542 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-26 13:11:48,554 INFO L191 MainTranslator]: Completed pre-run [2018-11-26 13:11:48,679 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-26 13:11:48,743 INFO L195 MainTranslator]: Completed translation [2018-11-26 13:11:48,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48 WrapperNode [2018-11-26 13:11:48,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-26 13:11:48,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-26 13:11:48,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-26 13:11:48,745 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-26 13:11:48,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48" (1/1) ... [2018-11-26 13:11:48,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48" (1/1) ... [2018-11-26 13:11:48,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-26 13:11:48,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-26 13:11:48,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-26 13:11:48,808 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-26 13:11:48,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48" (1/1) ... [2018-11-26 13:11:48,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48" (1/1) ... [2018-11-26 13:11:48,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48" (1/1) ... [2018-11-26 13:11:48,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48" (1/1) ... [2018-11-26 13:11:48,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48" (1/1) ... [2018-11-26 13:11:48,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48" (1/1) ... [2018-11-26 13:11:48,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48" (1/1) ... [2018-11-26 13:11:48,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-26 13:11:48,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-26 13:11:48,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-26 13:11:48,851 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-26 13:11:48,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48" (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-26 13:11:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-26 13:11:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-26 13:11:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-26 13:11:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-26 13:11:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-26 13:11:48,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-26 13:11:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-26 13:11:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-26 13:11:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-26 13:11:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-26 13:11:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-26 13:11:48,910 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-26 13:11:49,759 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-26 13:11:49,760 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-26 13:11:49,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:11:49 BoogieIcfgContainer [2018-11-26 13:11:49,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-26 13:11:49,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-26 13:11:49,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-26 13:11:49,765 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-26 13:11:49,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:11:48" (1/3) ... [2018-11-26 13:11:49,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba3e793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:11:49, skipping insertion in model container [2018-11-26 13:11:49,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:48" (2/3) ... [2018-11-26 13:11:49,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba3e793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:11:49, skipping insertion in model container [2018-11-26 13:11:49,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:11:49" (3/3) ... [2018-11-26 13:11:49,768 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_tso.oepc_true-unreach-call.i [2018-11-26 13:11:49,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,817 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,817 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,826 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,826 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,826 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,827 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,827 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,851 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,851 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,851 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,851 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,851 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,851 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,852 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,852 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,852 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,852 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,852 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,853 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,853 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,853 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,853 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,853 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,853 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,854 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,854 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,854 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,854 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,854 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,855 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,855 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,855 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,855 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,855 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-26 13:11:49,872 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-26 13:11:49,872 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-26 13:11:49,882 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-26 13:11:49,897 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-26 13:11:49,921 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-26 13:11:49,921 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-26 13:11:49,922 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-26 13:11:49,922 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-26 13:11:49,922 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-26 13:11:49,922 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-26 13:11:49,922 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-26 13:11:49,922 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-26 13:11:49,922 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-26 13:11:49,937 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 226places, 306 transitions [2018-11-26 13:12:01,640 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 125048 states. [2018-11-26 13:12:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 125048 states. [2018-11-26 13:12:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-26 13:12:01,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:12:01,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:12:01,655 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:12:01,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:12:01,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1224915915, now seen corresponding path program 1 times [2018-11-26 13:12:01,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:12:01,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:12:01,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:01,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:12:01,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:12:01,915 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-26 13:12:01,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:12:01,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:12:01,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:12:01,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:12:01,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:12:01,943 INFO L87 Difference]: Start difference. First operand 125048 states. Second operand 4 states. [2018-11-26 13:12:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:12:04,223 INFO L93 Difference]: Finished difference Result 240604 states and 990158 transitions. [2018-11-26 13:12:04,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:12:04,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-26 13:12:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:12:05,343 INFO L225 Difference]: With dead ends: 240604 [2018-11-26 13:12:05,343 INFO L226 Difference]: Without dead ends: 212996 [2018-11-26 13:12:05,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:12:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212996 states. [2018-11-26 13:12:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212996 to 112198. [2018-11-26 13:12:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112198 states. [2018-11-26 13:12:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112198 states to 112198 states and 465587 transitions. [2018-11-26 13:12:14,497 INFO L78 Accepts]: Start accepts. Automaton has 112198 states and 465587 transitions. Word has length 37 [2018-11-26 13:12:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:12:14,498 INFO L480 AbstractCegarLoop]: Abstraction has 112198 states and 465587 transitions. [2018-11-26 13:12:14,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:12:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 112198 states and 465587 transitions. [2018-11-26 13:12:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-26 13:12:14,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:12:14,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:12:14,506 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:12:14,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:12:14,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1539016196, now seen corresponding path program 1 times [2018-11-26 13:12:14,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:12:14,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:12:14,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:14,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:12:14,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:12:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:12:14,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:12:14,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:12:14,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:12:14,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:12:14,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:12:14,600 INFO L87 Difference]: Start difference. First operand 112198 states and 465587 transitions. Second operand 5 states. [2018-11-26 13:12:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:12:18,271 INFO L93 Difference]: Finished difference Result 337662 states and 1310633 transitions. [2018-11-26 13:12:18,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-26 13:12:18,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-26 13:12:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:12:19,447 INFO L225 Difference]: With dead ends: 337662 [2018-11-26 13:12:19,447 INFO L226 Difference]: Without dead ends: 337502 [2018-11-26 13:12:19,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:12:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337502 states. [2018-11-26 13:12:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337502 to 182336. [2018-11-26 13:12:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182336 states. [2018-11-26 13:12:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182336 states to 182336 states and 707538 transitions. [2018-11-26 13:12:31,519 INFO L78 Accepts]: Start accepts. Automaton has 182336 states and 707538 transitions. Word has length 44 [2018-11-26 13:12:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:12:31,520 INFO L480 AbstractCegarLoop]: Abstraction has 182336 states and 707538 transitions. [2018-11-26 13:12:31,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:12:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 182336 states and 707538 transitions. [2018-11-26 13:12:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-26 13:12:31,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:12:31,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:12:31,525 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:12:31,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:12:31,525 INFO L82 PathProgramCache]: Analyzing trace with hash -7464308, now seen corresponding path program 1 times [2018-11-26 13:12:31,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:12:31,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:12:31,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:31,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:12:31,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:12:31,602 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-26 13:12:31,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:12:31,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:12:31,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:12:31,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:12:31,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:12:31,603 INFO L87 Difference]: Start difference. First operand 182336 states and 707538 transitions. Second operand 4 states. [2018-11-26 13:12:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:12:31,789 INFO L93 Difference]: Finished difference Result 39892 states and 138215 transitions. [2018-11-26 13:12:31,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:12:31,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-26 13:12:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:12:31,862 INFO L225 Difference]: With dead ends: 39892 [2018-11-26 13:12:31,862 INFO L226 Difference]: Without dead ends: 37019 [2018-11-26 13:12:31,862 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-26 13:12:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37019 states. [2018-11-26 13:12:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37019 to 37019. [2018-11-26 13:12:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37019 states. [2018-11-26 13:12:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37019 states to 37019 states and 128876 transitions. [2018-11-26 13:12:32,472 INFO L78 Accepts]: Start accepts. Automaton has 37019 states and 128876 transitions. Word has length 45 [2018-11-26 13:12:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:12:32,472 INFO L480 AbstractCegarLoop]: Abstraction has 37019 states and 128876 transitions. [2018-11-26 13:12:32,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:12:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 37019 states and 128876 transitions. [2018-11-26 13:12:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-26 13:12:32,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:12:32,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:12:32,477 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:12:32,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:12:32,478 INFO L82 PathProgramCache]: Analyzing trace with hash -45321192, now seen corresponding path program 1 times [2018-11-26 13:12:32,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:12:32,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:12:32,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:32,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:12:32,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:12:32,580 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-26 13:12:32,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:12:32,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:12:32,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:12:32,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:12:32,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:12:32,582 INFO L87 Difference]: Start difference. First operand 37019 states and 128876 transitions. Second operand 4 states. [2018-11-26 13:12:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:12:33,234 INFO L93 Difference]: Finished difference Result 49059 states and 166861 transitions. [2018-11-26 13:12:33,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:12:33,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-26 13:12:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:12:33,318 INFO L225 Difference]: With dead ends: 49059 [2018-11-26 13:12:33,318 INFO L226 Difference]: Without dead ends: 49059 [2018-11-26 13:12:33,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:12:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49059 states. [2018-11-26 13:12:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49059 to 42063. [2018-11-26 13:12:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42063 states. [2018-11-26 13:12:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42063 states to 42063 states and 144442 transitions. [2018-11-26 13:12:34,052 INFO L78 Accepts]: Start accepts. Automaton has 42063 states and 144442 transitions. Word has length 58 [2018-11-26 13:12:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:12:34,052 INFO L480 AbstractCegarLoop]: Abstraction has 42063 states and 144442 transitions. [2018-11-26 13:12:34,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:12:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 42063 states and 144442 transitions. [2018-11-26 13:12:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-26 13:12:34,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:12:34,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:12:34,058 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:12:34,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:12:34,058 INFO L82 PathProgramCache]: Analyzing trace with hash -340567146, now seen corresponding path program 1 times [2018-11-26 13:12:34,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:12:34,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:12:34,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:34,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:12:34,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:12:34,133 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-26 13:12:34,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:12:34,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:12:34,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:12:34,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:12:34,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:12:34,134 INFO L87 Difference]: Start difference. First operand 42063 states and 144442 transitions. Second operand 4 states. [2018-11-26 13:12:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:12:35,348 INFO L93 Difference]: Finished difference Result 49638 states and 166843 transitions. [2018-11-26 13:12:35,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:12:35,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-26 13:12:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:12:35,451 INFO L225 Difference]: With dead ends: 49638 [2018-11-26 13:12:35,451 INFO L226 Difference]: Without dead ends: 49638 [2018-11-26 13:12:35,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:12:35,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49638 states. [2018-11-26 13:12:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49638 to 46731. [2018-11-26 13:12:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46731 states. [2018-11-26 13:12:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46731 states to 46731 states and 158580 transitions. [2018-11-26 13:12:36,177 INFO L78 Accepts]: Start accepts. Automaton has 46731 states and 158580 transitions. Word has length 58 [2018-11-26 13:12:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:12:36,177 INFO L480 AbstractCegarLoop]: Abstraction has 46731 states and 158580 transitions. [2018-11-26 13:12:36,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:12:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 46731 states and 158580 transitions. [2018-11-26 13:12:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-26 13:12:36,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:12:36,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:12:36,184 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:12:36,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:12:36,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1012742551, now seen corresponding path program 1 times [2018-11-26 13:12:36,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:12:36,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:12:36,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:36,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:12:36,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:12:36,277 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-26 13:12:36,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:12:36,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:12:36,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:12:36,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:12:36,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:12:36,279 INFO L87 Difference]: Start difference. First operand 46731 states and 158580 transitions. Second operand 6 states. [2018-11-26 13:12:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:12:37,560 INFO L93 Difference]: Finished difference Result 69263 states and 233515 transitions. [2018-11-26 13:12:37,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-26 13:12:37,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-11-26 13:12:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:12:38,521 INFO L225 Difference]: With dead ends: 69263 [2018-11-26 13:12:38,521 INFO L226 Difference]: Without dead ends: 69231 [2018-11-26 13:12:38,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-26 13:12:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69231 states. [2018-11-26 13:12:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69231 to 55787. [2018-11-26 13:12:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55787 states. [2018-11-26 13:12:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55787 states to 55787 states and 187260 transitions. [2018-11-26 13:12:39,558 INFO L78 Accepts]: Start accepts. Automaton has 55787 states and 187260 transitions. Word has length 58 [2018-11-26 13:12:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:12:39,558 INFO L480 AbstractCegarLoop]: Abstraction has 55787 states and 187260 transitions. [2018-11-26 13:12:39,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:12:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 55787 states and 187260 transitions. [2018-11-26 13:12:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-26 13:12:39,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:12:39,581 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] [2018-11-26 13:12:39,581 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:12:39,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:12:39,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1986386371, now seen corresponding path program 1 times [2018-11-26 13:12:39,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:12:39,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:12:39,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:39,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:12:39,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:12:39,687 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-26 13:12:39,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:12:39,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:12:39,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:12:39,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:12:39,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:12:39,688 INFO L87 Difference]: Start difference. First operand 55787 states and 187260 transitions. Second operand 7 states. [2018-11-26 13:12:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:12:42,572 INFO L93 Difference]: Finished difference Result 132794 states and 435152 transitions. [2018-11-26 13:12:42,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-26 13:12:42,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-11-26 13:12:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:12:42,829 INFO L225 Difference]: With dead ends: 132794 [2018-11-26 13:12:42,830 INFO L226 Difference]: Without dead ends: 132382 [2018-11-26 13:12:42,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2018-11-26 13:12:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132382 states. [2018-11-26 13:12:44,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132382 to 93545. [2018-11-26 13:12:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93545 states. [2018-11-26 13:12:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93545 states to 93545 states and 309427 transitions. [2018-11-26 13:12:45,278 INFO L78 Accepts]: Start accepts. Automaton has 93545 states and 309427 transitions. Word has length 72 [2018-11-26 13:12:45,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:12:45,278 INFO L480 AbstractCegarLoop]: Abstraction has 93545 states and 309427 transitions. [2018-11-26 13:12:45,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:12:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 93545 states and 309427 transitions. [2018-11-26 13:12:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-26 13:12:45,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:12:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:12:45,314 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:12:45,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:12:45,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1248674235, now seen corresponding path program 1 times [2018-11-26 13:12:45,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:12:45,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:12:45,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:45,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:12:45,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:12:45,412 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-26 13:12:45,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:12:45,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:12:45,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:12:45,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:12:45,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:12:45,413 INFO L87 Difference]: Start difference. First operand 93545 states and 309427 transitions. Second operand 7 states. [2018-11-26 13:12:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:12:47,283 INFO L93 Difference]: Finished difference Result 118197 states and 390628 transitions. [2018-11-26 13:12:47,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-26 13:12:47,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-11-26 13:12:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:12:47,506 INFO L225 Difference]: With dead ends: 118197 [2018-11-26 13:12:47,507 INFO L226 Difference]: Without dead ends: 118133 [2018-11-26 13:12:47,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-26 13:12:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118133 states. [2018-11-26 13:12:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118133 to 102417. [2018-11-26 13:12:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102417 states. [2018-11-26 13:12:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102417 states to 102417 states and 336813 transitions. [2018-11-26 13:12:49,208 INFO L78 Accepts]: Start accepts. Automaton has 102417 states and 336813 transitions. Word has length 72 [2018-11-26 13:12:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:12:49,208 INFO L480 AbstractCegarLoop]: Abstraction has 102417 states and 336813 transitions. [2018-11-26 13:12:49,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:12:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 102417 states and 336813 transitions. [2018-11-26 13:12:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-26 13:12:49,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:12:49,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:12:49,253 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:12:49,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:12:49,253 INFO L82 PathProgramCache]: Analyzing trace with hash 21000313, now seen corresponding path program 1 times [2018-11-26 13:12:49,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:12:49,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:12:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:49,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:12:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:12:49,297 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-26 13:12:49,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:12:49,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:12:49,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:12:49,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:12:49,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:12:49,298 INFO L87 Difference]: Start difference. First operand 102417 states and 336813 transitions. Second operand 3 states. [2018-11-26 13:12:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:12:49,999 INFO L93 Difference]: Finished difference Result 153893 states and 493160 transitions. [2018-11-26 13:12:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:12:49,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-26 13:12:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:12:50,305 INFO L225 Difference]: With dead ends: 153893 [2018-11-26 13:12:50,305 INFO L226 Difference]: Without dead ends: 153893 [2018-11-26 13:12:50,306 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-26 13:12:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153893 states. [2018-11-26 13:12:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153893 to 130553. [2018-11-26 13:12:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130553 states. [2018-11-26 13:12:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130553 states to 130553 states and 421076 transitions. [2018-11-26 13:12:52,840 INFO L78 Accepts]: Start accepts. Automaton has 130553 states and 421076 transitions. Word has length 74 [2018-11-26 13:12:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:12:52,840 INFO L480 AbstractCegarLoop]: Abstraction has 130553 states and 421076 transitions. [2018-11-26 13:12:52,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:12:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 130553 states and 421076 transitions. [2018-11-26 13:12:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-26 13:12:52,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:12:52,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:12:52,890 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:12:52,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:12:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash 744217605, now seen corresponding path program 1 times [2018-11-26 13:12:52,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:12:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:12:52,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:52,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:12:52,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:12:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:12:53,056 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-26 13:12:53,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:12:53,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-26 13:12:53,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-26 13:12:53,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-26 13:12:53,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:12:53,057 INFO L87 Difference]: Start difference. First operand 130553 states and 421076 transitions. Second operand 10 states. [2018-11-26 13:12:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:12:57,855 INFO L93 Difference]: Finished difference Result 175379 states and 548653 transitions. [2018-11-26 13:12:57,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-26 13:12:57,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-11-26 13:12:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:12:58,220 INFO L225 Difference]: With dead ends: 175379 [2018-11-26 13:12:58,220 INFO L226 Difference]: Without dead ends: 175315 [2018-11-26 13:12:58,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=375, Invalid=1431, Unknown=0, NotChecked=0, Total=1806 [2018-11-26 13:12:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175315 states. [2018-11-26 13:13:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175315 to 143179. [2018-11-26 13:13:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143179 states. [2018-11-26 13:13:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143179 states to 143179 states and 455731 transitions. [2018-11-26 13:13:01,334 INFO L78 Accepts]: Start accepts. Automaton has 143179 states and 455731 transitions. Word has length 78 [2018-11-26 13:13:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:01,334 INFO L480 AbstractCegarLoop]: Abstraction has 143179 states and 455731 transitions. [2018-11-26 13:13:01,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-26 13:13:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 143179 states and 455731 transitions. [2018-11-26 13:13:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-26 13:13:01,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:01,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:01,399 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:01,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:01,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2021084142, now seen corresponding path program 1 times [2018-11-26 13:13:01,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:01,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:01,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:01,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:01,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:13:01,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:13:01,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:13:01,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:01,501 INFO L87 Difference]: Start difference. First operand 143179 states and 455731 transitions. Second operand 6 states. [2018-11-26 13:13:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:03,037 INFO L93 Difference]: Finished difference Result 255899 states and 819251 transitions. [2018-11-26 13:13:03,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:13:03,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-26 13:13:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:03,598 INFO L225 Difference]: With dead ends: 255899 [2018-11-26 13:13:03,598 INFO L226 Difference]: Without dead ends: 255899 [2018-11-26 13:13:03,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:13:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255899 states. [2018-11-26 13:13:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255899 to 140438. [2018-11-26 13:13:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140438 states. [2018-11-26 13:13:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140438 states to 140438 states and 446234 transitions. [2018-11-26 13:13:07,007 INFO L78 Accepts]: Start accepts. Automaton has 140438 states and 446234 transitions. Word has length 81 [2018-11-26 13:13:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:07,007 INFO L480 AbstractCegarLoop]: Abstraction has 140438 states and 446234 transitions. [2018-11-26 13:13:07,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:13:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 140438 states and 446234 transitions. [2018-11-26 13:13:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-26 13:13:07,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:07,060 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] [2018-11-26 13:13:07,060 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:07,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:07,060 INFO L82 PathProgramCache]: Analyzing trace with hash -548402257, now seen corresponding path program 1 times [2018-11-26 13:13:07,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:07,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:07,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:07,118 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-26 13:13:07,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:07,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:13:07,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:13:07,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:13:07,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:13:07,120 INFO L87 Difference]: Start difference. First operand 140438 states and 446234 transitions. Second operand 3 states. [2018-11-26 13:13:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:07,687 INFO L93 Difference]: Finished difference Result 135058 states and 424811 transitions. [2018-11-26 13:13:07,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:13:07,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-26 13:13:07,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:07,916 INFO L225 Difference]: With dead ends: 135058 [2018-11-26 13:13:07,916 INFO L226 Difference]: Without dead ends: 134898 [2018-11-26 13:13:07,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:13:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134898 states. [2018-11-26 13:13:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134898 to 134706. [2018-11-26 13:13:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134706 states. [2018-11-26 13:13:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134706 states to 134706 states and 423907 transitions. [2018-11-26 13:13:10,334 INFO L78 Accepts]: Start accepts. Automaton has 134706 states and 423907 transitions. Word has length 81 [2018-11-26 13:13:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:10,334 INFO L480 AbstractCegarLoop]: Abstraction has 134706 states and 423907 transitions. [2018-11-26 13:13:10,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:13:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 134706 states and 423907 transitions. [2018-11-26 13:13:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-26 13:13:10,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:10,384 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] [2018-11-26 13:13:10,384 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:10,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:10,384 INFO L82 PathProgramCache]: Analyzing trace with hash 263975479, now seen corresponding path program 1 times [2018-11-26 13:13:10,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:10,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:10,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:10,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:10,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:10,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:10,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:10,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:10,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:10,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:10,448 INFO L87 Difference]: Start difference. First operand 134706 states and 423907 transitions. Second operand 5 states. [2018-11-26 13:13:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:10,536 INFO L93 Difference]: Finished difference Result 14686 states and 36728 transitions. [2018-11-26 13:13:10,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:13:10,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-11-26 13:13:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:10,549 INFO L225 Difference]: With dead ends: 14686 [2018-11-26 13:13:10,550 INFO L226 Difference]: Without dead ends: 11258 [2018-11-26 13:13:10,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11258 states. [2018-11-26 13:13:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11258 to 8612. [2018-11-26 13:13:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8612 states. [2018-11-26 13:13:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8612 states to 8612 states and 21184 transitions. [2018-11-26 13:13:10,651 INFO L78 Accepts]: Start accepts. Automaton has 8612 states and 21184 transitions. Word has length 82 [2018-11-26 13:13:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:10,651 INFO L480 AbstractCegarLoop]: Abstraction has 8612 states and 21184 transitions. [2018-11-26 13:13:10,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 8612 states and 21184 transitions. [2018-11-26 13:13:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:13:10,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:10,659 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, 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-26 13:13:10,660 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:10,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:10,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1059639962, now seen corresponding path program 1 times [2018-11-26 13:13:10,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:10,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:10,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:10,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:10,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:10,762 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-26 13:13:10,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:10,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:10,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:10,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:10,764 INFO L87 Difference]: Start difference. First operand 8612 states and 21184 transitions. Second operand 4 states. [2018-11-26 13:13:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:10,977 INFO L93 Difference]: Finished difference Result 9320 states and 22880 transitions. [2018-11-26 13:13:10,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:10,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-26 13:13:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:10,989 INFO L225 Difference]: With dead ends: 9320 [2018-11-26 13:13:10,989 INFO L226 Difference]: Without dead ends: 9320 [2018-11-26 13:13:10,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2018-11-26 13:13:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 8732. [2018-11-26 13:13:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8732 states. [2018-11-26 13:13:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8732 states to 8732 states and 21456 transitions. [2018-11-26 13:13:11,075 INFO L78 Accepts]: Start accepts. Automaton has 8732 states and 21456 transitions. Word has length 127 [2018-11-26 13:13:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:11,076 INFO L480 AbstractCegarLoop]: Abstraction has 8732 states and 21456 transitions. [2018-11-26 13:13:11,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 8732 states and 21456 transitions. [2018-11-26 13:13:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:13:11,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:11,084 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, 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-26 13:13:11,084 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:11,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1982323545, now seen corresponding path program 1 times [2018-11-26 13:13:11,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:11,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:11,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:11,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-26 13:13:11,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:11,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:13:11,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:13:11,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:13:11,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:11,186 INFO L87 Difference]: Start difference. First operand 8732 states and 21456 transitions. Second operand 6 states. [2018-11-26 13:13:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:12,077 INFO L93 Difference]: Finished difference Result 22444 states and 53703 transitions. [2018-11-26 13:13:12,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-26 13:13:12,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-26 13:13:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:12,105 INFO L225 Difference]: With dead ends: 22444 [2018-11-26 13:13:12,105 INFO L226 Difference]: Without dead ends: 22444 [2018-11-26 13:13:12,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:13:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22444 states. [2018-11-26 13:13:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22444 to 9551. [2018-11-26 13:13:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9551 states. [2018-11-26 13:13:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9551 states to 9551 states and 23410 transitions. [2018-11-26 13:13:12,252 INFO L78 Accepts]: Start accepts. Automaton has 9551 states and 23410 transitions. Word has length 127 [2018-11-26 13:13:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:12,253 INFO L480 AbstractCegarLoop]: Abstraction has 9551 states and 23410 transitions. [2018-11-26 13:13:12,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:13:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9551 states and 23410 transitions. [2018-11-26 13:13:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:13:12,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:12,261 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, 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-26 13:13:12,261 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:12,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash 302539910, now seen corresponding path program 1 times [2018-11-26 13:13:12,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:12,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:12,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:12,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:12,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:12,377 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-26 13:13:12,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:12,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:13:12,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:13:12,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:13:12,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:12,379 INFO L87 Difference]: Start difference. First operand 9551 states and 23410 transitions. Second operand 7 states. [2018-11-26 13:13:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:13,621 INFO L93 Difference]: Finished difference Result 22730 states and 54399 transitions. [2018-11-26 13:13:13,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-26 13:13:13,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-11-26 13:13:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:13,649 INFO L225 Difference]: With dead ends: 22730 [2018-11-26 13:13:13,649 INFO L226 Difference]: Without dead ends: 22666 [2018-11-26 13:13:13,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:13:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22666 states. [2018-11-26 13:13:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22666 to 9959. [2018-11-26 13:13:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9959 states. [2018-11-26 13:13:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9959 states to 9959 states and 24388 transitions. [2018-11-26 13:13:13,811 INFO L78 Accepts]: Start accepts. Automaton has 9959 states and 24388 transitions. Word has length 127 [2018-11-26 13:13:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:13,811 INFO L480 AbstractCegarLoop]: Abstraction has 9959 states and 24388 transitions. [2018-11-26 13:13:13,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:13:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 9959 states and 24388 transitions. [2018-11-26 13:13:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:13:13,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:13,820 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, 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-26 13:13:13,820 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:13,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:13,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1264153927, now seen corresponding path program 1 times [2018-11-26 13:13:13,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:13,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:13,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:13,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:13,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:13,973 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-26 13:13:13,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:13,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:13:13,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:13:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:13:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:13:13,974 INFO L87 Difference]: Start difference. First operand 9959 states and 24388 transitions. Second operand 8 states. [2018-11-26 13:13:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:14,513 INFO L93 Difference]: Finished difference Result 17297 states and 40757 transitions. [2018-11-26 13:13:14,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-26 13:13:14,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-11-26 13:13:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:14,534 INFO L225 Difference]: With dead ends: 17297 [2018-11-26 13:13:14,534 INFO L226 Difference]: Without dead ends: 17220 [2018-11-26 13:13:14,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-26 13:13:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17220 states. [2018-11-26 13:13:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17220 to 14125. [2018-11-26 13:13:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14125 states. [2018-11-26 13:13:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14125 states to 14125 states and 33853 transitions. [2018-11-26 13:13:14,731 INFO L78 Accepts]: Start accepts. Automaton has 14125 states and 33853 transitions. Word has length 127 [2018-11-26 13:13:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:14,731 INFO L480 AbstractCegarLoop]: Abstraction has 14125 states and 33853 transitions. [2018-11-26 13:13:14,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:13:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 14125 states and 33853 transitions. [2018-11-26 13:13:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:13:14,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:14,745 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, 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-26 13:13:14,745 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:14,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:14,745 INFO L82 PathProgramCache]: Analyzing trace with hash 376983464, now seen corresponding path program 1 times [2018-11-26 13:13:14,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:14,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:14,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:14,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:14,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:14,849 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-26 13:13:14,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:14,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:13:14,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:13:14,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:13:14,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:14,850 INFO L87 Difference]: Start difference. First operand 14125 states and 33853 transitions. Second operand 7 states. [2018-11-26 13:13:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:15,314 INFO L93 Difference]: Finished difference Result 18371 states and 43262 transitions. [2018-11-26 13:13:15,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-26 13:13:15,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-11-26 13:13:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:15,336 INFO L225 Difference]: With dead ends: 18371 [2018-11-26 13:13:15,337 INFO L226 Difference]: Without dead ends: 18371 [2018-11-26 13:13:15,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:13:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18371 states. [2018-11-26 13:13:15,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18371 to 16631. [2018-11-26 13:13:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16631 states. [2018-11-26 13:13:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16631 states to 16631 states and 39211 transitions. [2018-11-26 13:13:15,523 INFO L78 Accepts]: Start accepts. Automaton has 16631 states and 39211 transitions. Word has length 127 [2018-11-26 13:13:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:15,523 INFO L480 AbstractCegarLoop]: Abstraction has 16631 states and 39211 transitions. [2018-11-26 13:13:15,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:13:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 16631 states and 39211 transitions. [2018-11-26 13:13:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:13:15,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:15,540 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, 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-26 13:13:15,541 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:15,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:15,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1633120377, now seen corresponding path program 1 times [2018-11-26 13:13:15,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:15,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:15,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:15,691 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-26 13:13:15,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:15,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:13:15,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:13:15,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:13:15,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:13:15,693 INFO L87 Difference]: Start difference. First operand 16631 states and 39211 transitions. Second operand 8 states. [2018-11-26 13:13:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:16,895 INFO L93 Difference]: Finished difference Result 18635 states and 43981 transitions. [2018-11-26 13:13:16,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-26 13:13:16,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-11-26 13:13:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:16,915 INFO L225 Difference]: With dead ends: 18635 [2018-11-26 13:13:16,915 INFO L226 Difference]: Without dead ends: 18635 [2018-11-26 13:13:16,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:13:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18635 states. [2018-11-26 13:13:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18635 to 16947. [2018-11-26 13:13:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16947 states. [2018-11-26 13:13:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16947 states to 16947 states and 39822 transitions. [2018-11-26 13:13:17,085 INFO L78 Accepts]: Start accepts. Automaton has 16947 states and 39822 transitions. Word has length 127 [2018-11-26 13:13:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:17,085 INFO L480 AbstractCegarLoop]: Abstraction has 16947 states and 39822 transitions. [2018-11-26 13:13:17,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:13:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 16947 states and 39822 transitions. [2018-11-26 13:13:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:13:17,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:17,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 13:13:17,100 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:17,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1727711016, now seen corresponding path program 1 times [2018-11-26 13:13:17,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:17,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:17,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:17,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:17,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:17,183 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-26 13:13:17,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:17,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:17,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:17,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:17,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:17,184 INFO L87 Difference]: Start difference. First operand 16947 states and 39822 transitions. Second operand 4 states. [2018-11-26 13:13:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:17,305 INFO L93 Difference]: Finished difference Result 16787 states and 39294 transitions. [2018-11-26 13:13:17,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:13:17,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-26 13:13:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:17,332 INFO L225 Difference]: With dead ends: 16787 [2018-11-26 13:13:17,332 INFO L226 Difference]: Without dead ends: 16787 [2018-11-26 13:13:17,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16787 states. [2018-11-26 13:13:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16787 to 13491. [2018-11-26 13:13:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13491 states. [2018-11-26 13:13:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13491 states to 13491 states and 31913 transitions. [2018-11-26 13:13:17,604 INFO L78 Accepts]: Start accepts. Automaton has 13491 states and 31913 transitions. Word has length 127 [2018-11-26 13:13:17,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:17,604 INFO L480 AbstractCegarLoop]: Abstraction has 13491 states and 31913 transitions. [2018-11-26 13:13:17,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 13491 states and 31913 transitions. [2018-11-26 13:13:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:13:17,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:17,625 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, 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-26 13:13:17,625 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:17,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash 679221192, now seen corresponding path program 1 times [2018-11-26 13:13:17,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:17,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:17,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:17,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:17,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:17,750 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-26 13:13:17,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:17,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:17,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:17,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:17,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:17,752 INFO L87 Difference]: Start difference. First operand 13491 states and 31913 transitions. Second operand 5 states. [2018-11-26 13:13:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:18,082 INFO L93 Difference]: Finished difference Result 13939 states and 33017 transitions. [2018-11-26 13:13:18,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:13:18,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-11-26 13:13:18,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:18,100 INFO L225 Difference]: With dead ends: 13939 [2018-11-26 13:13:18,100 INFO L226 Difference]: Without dead ends: 13907 [2018-11-26 13:13:18,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:18,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13907 states. [2018-11-26 13:13:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13907 to 13017. [2018-11-26 13:13:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13017 states. [2018-11-26 13:13:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13017 states to 13017 states and 30722 transitions. [2018-11-26 13:13:18,260 INFO L78 Accepts]: Start accepts. Automaton has 13017 states and 30722 transitions. Word has length 127 [2018-11-26 13:13:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:18,260 INFO L480 AbstractCegarLoop]: Abstraction has 13017 states and 30722 transitions. [2018-11-26 13:13:18,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 13017 states and 30722 transitions. [2018-11-26 13:13:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:13:18,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:18,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 13:13:18,274 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:18,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1923985673, now seen corresponding path program 1 times [2018-11-26 13:13:18,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:18,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:18,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:18,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:18,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:18,387 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-26 13:13:18,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:18,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:13:18,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:13:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:13:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:18,389 INFO L87 Difference]: Start difference. First operand 13017 states and 30722 transitions. Second operand 6 states. [2018-11-26 13:13:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:19,292 INFO L93 Difference]: Finished difference Result 16250 states and 37503 transitions. [2018-11-26 13:13:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-26 13:13:19,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-26 13:13:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:19,312 INFO L225 Difference]: With dead ends: 16250 [2018-11-26 13:13:19,312 INFO L226 Difference]: Without dead ends: 15975 [2018-11-26 13:13:19,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:13:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15975 states. [2018-11-26 13:13:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15975 to 13973. [2018-11-26 13:13:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13973 states. [2018-11-26 13:13:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13973 states to 13973 states and 32899 transitions. [2018-11-26 13:13:19,475 INFO L78 Accepts]: Start accepts. Automaton has 13973 states and 32899 transitions. Word has length 127 [2018-11-26 13:13:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:19,476 INFO L480 AbstractCegarLoop]: Abstraction has 13973 states and 32899 transitions. [2018-11-26 13:13:19,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:13:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 13973 states and 32899 transitions. [2018-11-26 13:13:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:13:19,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:19,490 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, 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-26 13:13:19,490 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:19,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:19,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1440310346, now seen corresponding path program 1 times [2018-11-26 13:13:19,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:19,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:19,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:19,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:19,620 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-26 13:13:19,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:19,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:13:19,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:13:19,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:13:19,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:19,621 INFO L87 Difference]: Start difference. First operand 13973 states and 32899 transitions. Second operand 7 states. [2018-11-26 13:13:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:20,339 INFO L93 Difference]: Finished difference Result 16600 states and 38819 transitions. [2018-11-26 13:13:20,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-26 13:13:20,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-11-26 13:13:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:20,359 INFO L225 Difference]: With dead ends: 16600 [2018-11-26 13:13:20,360 INFO L226 Difference]: Without dead ends: 16600 [2018-11-26 13:13:20,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:13:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16600 states. [2018-11-26 13:13:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16600 to 13664. [2018-11-26 13:13:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13664 states. [2018-11-26 13:13:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13664 states to 13664 states and 32077 transitions. [2018-11-26 13:13:20,525 INFO L78 Accepts]: Start accepts. Automaton has 13664 states and 32077 transitions. Word has length 127 [2018-11-26 13:13:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:20,525 INFO L480 AbstractCegarLoop]: Abstraction has 13664 states and 32077 transitions. [2018-11-26 13:13:20,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:13:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 13664 states and 32077 transitions. [2018-11-26 13:13:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:13:20,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:20,539 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, 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-26 13:13:20,539 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:20,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:20,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1734182847, now seen corresponding path program 2 times [2018-11-26 13:13:20,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:20,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:20,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:20,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:20,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:20,620 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-26 13:13:20,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:20,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:13:20,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:13:20,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:13:20,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:20,621 INFO L87 Difference]: Start difference. First operand 13664 states and 32077 transitions. Second operand 6 states. [2018-11-26 13:13:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:21,098 INFO L93 Difference]: Finished difference Result 14947 states and 34803 transitions. [2018-11-26 13:13:21,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:13:21,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-26 13:13:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:21,116 INFO L225 Difference]: With dead ends: 14947 [2018-11-26 13:13:21,116 INFO L226 Difference]: Without dead ends: 14902 [2018-11-26 13:13:21,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-26 13:13:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14902 states. [2018-11-26 13:13:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14902 to 14025. [2018-11-26 13:13:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14025 states. [2018-11-26 13:13:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14025 states to 14025 states and 32827 transitions. [2018-11-26 13:13:21,277 INFO L78 Accepts]: Start accepts. Automaton has 14025 states and 32827 transitions. Word has length 127 [2018-11-26 13:13:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:21,277 INFO L480 AbstractCegarLoop]: Abstraction has 14025 states and 32827 transitions. [2018-11-26 13:13:21,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:13:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 14025 states and 32827 transitions. [2018-11-26 13:13:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-26 13:13:21,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:21,292 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, 1, 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-26 13:13:21,292 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:21,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash 45932884, now seen corresponding path program 1 times [2018-11-26 13:13:21,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:21,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:21,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:21,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-26 13:13:21,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:21,388 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-26 13:13:21,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:21,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:13:21,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:13:21,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:13:21,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:21,390 INFO L87 Difference]: Start difference. First operand 14025 states and 32827 transitions. Second operand 6 states. [2018-11-26 13:13:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:22,232 INFO L93 Difference]: Finished difference Result 17575 states and 40472 transitions. [2018-11-26 13:13:22,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-26 13:13:22,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-11-26 13:13:22,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:22,252 INFO L225 Difference]: With dead ends: 17575 [2018-11-26 13:13:22,252 INFO L226 Difference]: Without dead ends: 17430 [2018-11-26 13:13:22,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-26 13:13:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17430 states. [2018-11-26 13:13:22,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17430 to 14191. [2018-11-26 13:13:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14191 states. [2018-11-26 13:13:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14191 states to 14191 states and 33248 transitions. [2018-11-26 13:13:22,424 INFO L78 Accepts]: Start accepts. Automaton has 14191 states and 33248 transitions. Word has length 129 [2018-11-26 13:13:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:22,424 INFO L480 AbstractCegarLoop]: Abstraction has 14191 states and 33248 transitions. [2018-11-26 13:13:22,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:13:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 14191 states and 33248 transitions. [2018-11-26 13:13:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-26 13:13:22,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:22,438 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, 1, 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-26 13:13:22,438 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:22,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:22,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2128747213, now seen corresponding path program 1 times [2018-11-26 13:13:22,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:22,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:22,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:22,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:22,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:22,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:22,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:13:22,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:13:22,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:13:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:22,548 INFO L87 Difference]: Start difference. First operand 14191 states and 33248 transitions. Second operand 7 states. [2018-11-26 13:13:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:23,160 INFO L93 Difference]: Finished difference Result 17022 states and 39714 transitions. [2018-11-26 13:13:23,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-26 13:13:23,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-11-26 13:13:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:23,180 INFO L225 Difference]: With dead ends: 17022 [2018-11-26 13:13:23,180 INFO L226 Difference]: Without dead ends: 17022 [2018-11-26 13:13:23,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:13:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17022 states. [2018-11-26 13:13:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17022 to 14192. [2018-11-26 13:13:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14192 states. [2018-11-26 13:13:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14192 states to 14192 states and 33251 transitions. [2018-11-26 13:13:23,345 INFO L78 Accepts]: Start accepts. Automaton has 14192 states and 33251 transitions. Word has length 129 [2018-11-26 13:13:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:23,345 INFO L480 AbstractCegarLoop]: Abstraction has 14192 states and 33251 transitions. [2018-11-26 13:13:23,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:13:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 14192 states and 33251 transitions. [2018-11-26 13:13:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-26 13:13:23,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:23,357 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, 1, 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-26 13:13:23,358 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:23,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:23,358 INFO L82 PathProgramCache]: Analyzing trace with hash 567684734, now seen corresponding path program 1 times [2018-11-26 13:13:23,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:23,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:23,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:23,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:23,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:23,458 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-26 13:13:23,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:23,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:23,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:23,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:23,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:23,460 INFO L87 Difference]: Start difference. First operand 14192 states and 33251 transitions. Second operand 5 states. [2018-11-26 13:13:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:23,532 INFO L93 Difference]: Finished difference Result 15088 states and 35010 transitions. [2018-11-26 13:13:23,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:13:23,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-11-26 13:13:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:23,551 INFO L225 Difference]: With dead ends: 15088 [2018-11-26 13:13:23,551 INFO L226 Difference]: Without dead ends: 15088 [2018-11-26 13:13:23,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15088 states. [2018-11-26 13:13:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15088 to 9447. [2018-11-26 13:13:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9447 states. [2018-11-26 13:13:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9447 states to 9447 states and 21679 transitions. [2018-11-26 13:13:23,681 INFO L78 Accepts]: Start accepts. Automaton has 9447 states and 21679 transitions. Word has length 129 [2018-11-26 13:13:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:23,682 INFO L480 AbstractCegarLoop]: Abstraction has 9447 states and 21679 transitions. [2018-11-26 13:13:23,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 9447 states and 21679 transitions. [2018-11-26 13:13:23,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-26 13:13:23,691 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:23,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 13:13:23,691 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:23,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:23,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1367975553, now seen corresponding path program 1 times [2018-11-26 13:13:23,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:23,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:23,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:23,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:23,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:23,800 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-26 13:13:23,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:23,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:13:23,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:13:23,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:13:23,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:13:23,801 INFO L87 Difference]: Start difference. First operand 9447 states and 21679 transitions. Second operand 8 states. [2018-11-26 13:13:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:24,243 INFO L93 Difference]: Finished difference Result 9802 states and 22418 transitions. [2018-11-26 13:13:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-26 13:13:24,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2018-11-26 13:13:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:24,254 INFO L225 Difference]: With dead ends: 9802 [2018-11-26 13:13:24,255 INFO L226 Difference]: Without dead ends: 9802 [2018-11-26 13:13:24,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:13:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2018-11-26 13:13:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 9503. [2018-11-26 13:13:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9503 states. [2018-11-26 13:13:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9503 states to 9503 states and 21787 transitions. [2018-11-26 13:13:24,356 INFO L78 Accepts]: Start accepts. Automaton has 9503 states and 21787 transitions. Word has length 129 [2018-11-26 13:13:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:24,356 INFO L480 AbstractCegarLoop]: Abstraction has 9503 states and 21787 transitions. [2018-11-26 13:13:24,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:13:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9503 states and 21787 transitions. [2018-11-26 13:13:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-26 13:13:24,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:24,365 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, 1, 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-26 13:13:24,366 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:24,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash -590399197, now seen corresponding path program 2 times [2018-11-26 13:13:24,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:24,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:24,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:24,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:24,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:24,455 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-26 13:13:24,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:24,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:13:24,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:13:24,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:13:24,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:24,457 INFO L87 Difference]: Start difference. First operand 9503 states and 21787 transitions. Second operand 6 states. [2018-11-26 13:13:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:24,977 INFO L93 Difference]: Finished difference Result 10527 states and 23886 transitions. [2018-11-26 13:13:24,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:13:24,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-11-26 13:13:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:24,991 INFO L225 Difference]: With dead ends: 10527 [2018-11-26 13:13:24,991 INFO L226 Difference]: Without dead ends: 10527 [2018-11-26 13:13:24,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:13:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10527 states. [2018-11-26 13:13:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10527 to 9797. [2018-11-26 13:13:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9797 states. [2018-11-26 13:13:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9797 states to 9797 states and 22387 transitions. [2018-11-26 13:13:25,101 INFO L78 Accepts]: Start accepts. Automaton has 9797 states and 22387 transitions. Word has length 129 [2018-11-26 13:13:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:25,101 INFO L480 AbstractCegarLoop]: Abstraction has 9797 states and 22387 transitions. [2018-11-26 13:13:25,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:13:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 9797 states and 22387 transitions. [2018-11-26 13:13:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-26 13:13:25,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:25,111 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, 1, 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-26 13:13:25,112 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:25,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:25,112 INFO L82 PathProgramCache]: Analyzing trace with hash 267672579, now seen corresponding path program 3 times [2018-11-26 13:13:25,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:25,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:25,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:25,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-26 13:13:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:25,229 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-26 13:13:25,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:25,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:13:25,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:13:25,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:13:25,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:13:25,231 INFO L87 Difference]: Start difference. First operand 9797 states and 22387 transitions. Second operand 8 states. [2018-11-26 13:13:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:26,032 INFO L93 Difference]: Finished difference Result 12463 states and 28256 transitions. [2018-11-26 13:13:26,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-26 13:13:26,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2018-11-26 13:13:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:26,048 INFO L225 Difference]: With dead ends: 12463 [2018-11-26 13:13:26,048 INFO L226 Difference]: Without dead ends: 12463 [2018-11-26 13:13:26,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:13:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12463 states. [2018-11-26 13:13:26,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12463 to 9797. [2018-11-26 13:13:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9797 states. [2018-11-26 13:13:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9797 states to 9797 states and 22387 transitions. [2018-11-26 13:13:26,177 INFO L78 Accepts]: Start accepts. Automaton has 9797 states and 22387 transitions. Word has length 129 [2018-11-26 13:13:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:26,177 INFO L480 AbstractCegarLoop]: Abstraction has 9797 states and 22387 transitions. [2018-11-26 13:13:26,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:13:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 9797 states and 22387 transitions. [2018-11-26 13:13:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-26 13:13:26,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:26,187 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, 1, 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-26 13:13:26,188 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:26,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:26,188 INFO L82 PathProgramCache]: Analyzing trace with hash 879166141, now seen corresponding path program 4 times [2018-11-26 13:13:26,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:26,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:26,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:26,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-26 13:13:26,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:26,308 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-26 13:13:26,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:26,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:13:26,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:13:26,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:13:26,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:13:26,309 INFO L87 Difference]: Start difference. First operand 9797 states and 22387 transitions. Second operand 8 states. [2018-11-26 13:13:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:27,324 INFO L93 Difference]: Finished difference Result 13134 states and 29684 transitions. [2018-11-26 13:13:27,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-26 13:13:27,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2018-11-26 13:13:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:27,339 INFO L225 Difference]: With dead ends: 13134 [2018-11-26 13:13:27,340 INFO L226 Difference]: Without dead ends: 13134 [2018-11-26 13:13:27,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-26 13:13:27,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13134 states. [2018-11-26 13:13:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13134 to 9672. [2018-11-26 13:13:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9672 states. [2018-11-26 13:13:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9672 states to 9672 states and 22150 transitions. [2018-11-26 13:13:27,444 INFO L78 Accepts]: Start accepts. Automaton has 9672 states and 22150 transitions. Word has length 129 [2018-11-26 13:13:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:27,444 INFO L480 AbstractCegarLoop]: Abstraction has 9672 states and 22150 transitions. [2018-11-26 13:13:27,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:13:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 9672 states and 22150 transitions. [2018-11-26 13:13:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-26 13:13:27,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:27,453 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, 1, 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-26 13:13:27,453 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:27,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:27,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1433250747, now seen corresponding path program 1 times [2018-11-26 13:13:27,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:27,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:27,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:27,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-26 13:13:27,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:27,562 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-26 13:13:27,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:27,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:13:27,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:13:27,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:13:27,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:27,564 INFO L87 Difference]: Start difference. First operand 9672 states and 22150 transitions. Second operand 7 states. [2018-11-26 13:13:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:28,083 INFO L93 Difference]: Finished difference Result 10169 states and 23196 transitions. [2018-11-26 13:13:28,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-26 13:13:28,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-11-26 13:13:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:28,095 INFO L225 Difference]: With dead ends: 10169 [2018-11-26 13:13:28,095 INFO L226 Difference]: Without dead ends: 10149 [2018-11-26 13:13:28,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:13:28,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10149 states. [2018-11-26 13:13:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10149 to 9698. [2018-11-26 13:13:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9698 states. [2018-11-26 13:13:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9698 states to 9698 states and 22201 transitions. [2018-11-26 13:13:28,201 INFO L78 Accepts]: Start accepts. Automaton has 9698 states and 22201 transitions. Word has length 129 [2018-11-26 13:13:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:28,201 INFO L480 AbstractCegarLoop]: Abstraction has 9698 states and 22201 transitions. [2018-11-26 13:13:28,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:13:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 9698 states and 22201 transitions. [2018-11-26 13:13:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-26 13:13:28,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:28,212 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, 1, 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-26 13:13:28,212 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:28,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:28,212 INFO L82 PathProgramCache]: Analyzing trace with hash 3372679, now seen corresponding path program 1 times [2018-11-26 13:13:28,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:28,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:28,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:28,431 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-26 13:13:28,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:28,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-26 13:13:28,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-26 13:13:28,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-26 13:13:28,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:13:28,432 INFO L87 Difference]: Start difference. First operand 9698 states and 22201 transitions. Second operand 12 states. [2018-11-26 13:13:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:29,861 INFO L93 Difference]: Finished difference Result 22697 states and 52298 transitions. [2018-11-26 13:13:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-26 13:13:29,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 129 [2018-11-26 13:13:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:29,876 INFO L225 Difference]: With dead ends: 22697 [2018-11-26 13:13:29,876 INFO L226 Difference]: Without dead ends: 12961 [2018-11-26 13:13:29,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2018-11-26 13:13:29,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states. [2018-11-26 13:13:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 9652. [2018-11-26 13:13:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9652 states. [2018-11-26 13:13:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9652 states to 9652 states and 22010 transitions. [2018-11-26 13:13:29,987 INFO L78 Accepts]: Start accepts. Automaton has 9652 states and 22010 transitions. Word has length 129 [2018-11-26 13:13:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:29,988 INFO L480 AbstractCegarLoop]: Abstraction has 9652 states and 22010 transitions. [2018-11-26 13:13:29,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-26 13:13:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 9652 states and 22010 transitions. [2018-11-26 13:13:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-26 13:13:29,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:29,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 13:13:29,997 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:29,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:29,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1412683190, now seen corresponding path program 1 times [2018-11-26 13:13:29,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:29,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:29,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:29,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:29,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:30,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:30,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-26 13:13:30,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-26 13:13:30,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-26 13:13:30,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-26 13:13:30,193 INFO L87 Difference]: Start difference. First operand 9652 states and 22010 transitions. Second operand 14 states. [2018-11-26 13:13:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:31,039 INFO L93 Difference]: Finished difference Result 15045 states and 34873 transitions. [2018-11-26 13:13:31,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-26 13:13:31,040 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 131 [2018-11-26 13:13:31,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:31,054 INFO L225 Difference]: With dead ends: 15045 [2018-11-26 13:13:31,055 INFO L226 Difference]: Without dead ends: 13207 [2018-11-26 13:13:31,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-11-26 13:13:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13207 states. [2018-11-26 13:13:31,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13207 to 10777. [2018-11-26 13:13:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10777 states. [2018-11-26 13:13:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10777 states to 10777 states and 24428 transitions. [2018-11-26 13:13:31,162 INFO L78 Accepts]: Start accepts. Automaton has 10777 states and 24428 transitions. Word has length 131 [2018-11-26 13:13:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:31,162 INFO L480 AbstractCegarLoop]: Abstraction has 10777 states and 24428 transitions. [2018-11-26 13:13:31,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-26 13:13:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10777 states and 24428 transitions. [2018-11-26 13:13:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-26 13:13:31,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:31,171 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, 1, 1, 1, 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-26 13:13:31,171 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:31,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:31,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1660627428, now seen corresponding path program 2 times [2018-11-26 13:13:31,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:31,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-26 13:13:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-26 13:13:31,278 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-26 13:13:31,456 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-26 13:13:31,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:13:31 BasicIcfg [2018-11-26 13:13:31,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-26 13:13:31,458 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-26 13:13:31,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-26 13:13:31,459 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-26 13:13:31,460 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:11:49" (3/4) ... [2018-11-26 13:13:31,463 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-26 13:13:31,642 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-26 13:13:31,642 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-26 13:13:31,644 INFO L168 Benchmark]: Toolchain (without parser) took 103535.76 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.5 GB). Free memory was 947.8 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-11-26 13:13:31,646 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-26 13:13:31,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2018-11-26 13:13:31,646 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.06 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-26 13:13:31,647 INFO L168 Benchmark]: Boogie Preprocessor took 43.09 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-26 13:13:31,647 INFO L168 Benchmark]: RCFGBuilder took 909.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.1 MB). Peak memory consumption was 75.1 MB. Max. memory is 11.5 GB. [2018-11-26 13:13:31,647 INFO L168 Benchmark]: TraceAbstraction took 101696.63 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-11-26 13:13:31,648 INFO L168 Benchmark]: Witness Printer took 184.08 ms. Allocated memory is still 5.5 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 87.3 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. [2018-11-26 13:13:31,650 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 633.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.06 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.09 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 909.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.1 MB). Peak memory consumption was 75.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 101696.63 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 184.08 ms. Allocated memory is still 5.5 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 87.3 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=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] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L789] -1 pthread_t t1599; VAL [__unbuffered_cnt=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] [L790] FCALL, FORK -1 pthread_create(&t1599, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L701] 0 y = 2 [L704] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L707] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L791] -1 pthread_t t1600; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L792] FCALL, FORK -1 pthread_create(&t1600, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L707] EXPR 0 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L721] 1 x = 2 [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L707] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd2 = (_Bool)1 [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 !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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 !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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] 1 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) [L740] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L740] 1 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)) [L741] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L741] 1 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)) [L742] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L742] 1 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)) [L743] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L743] 1 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)) [L744] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L744] 1 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)) [L745] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L745] 1 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)) [L746] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=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=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 [L751] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L752] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L753] 1 y$flush_delayed = weak$$choice2 [L754] 1 y$mem_tmp = y VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 !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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 !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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] 1 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) [L756] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L756] 1 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)) [L757] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L757] 1 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)) [L758] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L758] 1 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)) [L759] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L759] 1 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)) [L760] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L760] 1 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)) [L761] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L761] 1 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)) [L762] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L763] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L763] 1 y = y$flush_delayed ? y$mem_tmp : y [L764] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L767] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L767] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L768] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L707] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L769] EXPR 1 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L769] 1 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 [L708] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] EXPR 1 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 1 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 [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L709] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L710] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L710] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L714] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L798] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L798] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L798] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L798] -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) [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L799] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L800] -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 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L801] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L802] -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 [L805] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L806] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L807] -1 y$flush_delayed = weak$$choice2 [L808] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L809] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L809] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L810] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L811] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L812] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L813] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L814] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L815] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L817] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L817] -1 y = y$flush_delayed ? y$mem_tmp : y [L818] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 348 locations, 3 error locations. UNSAFE Result, 101.5s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 41.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19042 SDtfs, 20851 SDslu, 57610 SDs, 0 SdLazy, 22967 SolverSat, 1035 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 114 SyntacticMatches, 51 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182336occurred in iteration=2, 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: 43.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 575408 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3660 NumberOfCodeBlocks, 3660 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3495 ConstructedInterpolants, 0 QuantifiedInterpolants, 939475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...